We determine the maximum possible number of edges of a graph with n
vert...
In this paper, we show that, given two down-sets (simplicial complexes) ...
We introduce the following variant of the VC-dimension. Given S ⊆{0, 1}^...
For n > 2k ≥ 4 we consider intersecting families ℱ consisting
of k-subse...
For a family ℱ, let 𝒟(ℱ) stand for the family
of all sets that can be ex...
A family ℱ has covering number τ if the size of the smallest
set interse...
Given a family of sets on the plane, we say that the family is intersect...
In this paper, we investigate Erdős–Ko–Rado type theorems for families
o...
In this paper, we study the maximum degree in non-empty induced subgraph...
Let n > k > 1 be integers, [n] = {1, …, n}. Let ℱ be a
family of k-subse...
For an $n$-element set $X$ let $\binom{X}{k}$ be the collection of all i...
A family F⊂[n] k is U(s,q) of for any
F_1,..., F_s∈ F we have |F_1∪...∪...
We say that a family F of k-element sets is a j-junta if there
is a set...
Given a family F⊂ 2^[n], its diversity is the number of
sets not contai...
Let F⊂ 2^[n] be a family in which any three sets have
non-empty interse...
Some best possible inequalities are established for k-partition-free fam...