DOIAbstract
AbstractA set family A⊂[n](k) is called noncentred intersecting if it is intersecting but ⋂A∈AA=∅; let Lk(n) be the least number of noncentred intersecting families which cover [n](k). We prove that for k⩾3 fixed,Lk(n)=n22k(k−1)1+O1n
AbstractA set family A⊂[n](k) is called noncentred intersecting if it is intersecting but ⋂A∈AA=∅; let Lk(n) be the least number of noncentred intersecting families which cover [n](k). We prove that for k⩾3 fixed,Lk(n)=n22k(k−1)1+O1n
We call a family of sets intersecting, if any two sets in the family intersect. In this paper we inv...
We call a family of sets intersecting, if any two sets in the family intersect. In this paper we inv...
AbstractWe determine the maximum size of uniform intersecting families with covering number at least...
Let $n > k > 1$ be integers, $[n] = \{1, \ldots, n\}$. Let $\mathcal F$ be a family of $k$-subsets o...
A family A of sets is said to be intersecting if any two sets in A intersect. Families A1,...,Ap are...
A family $\mathcal F$ has covering number $\tau$ if the size of the smallest set intersecting all se...
AbstractA family F is intersecting if F∩F′≠∅ whenever F,F′∈F. Erdős, Ko, and Rado (1961) [6] showed ...
AbstractWe discuss the maximum size of uniform intersecting families with covering number at leastτ....
A family J of subsets of {1,..., n} is called a j-junta if there exists J ⊆ {1,..., n}, with |J | =...
AbstractLet H denote the set {f1,f2,…,fn}, 2[n] the collection of all subsets of H and F⊆2[n] be a f...
AbstractLet L={λ1,…,λs} be a set of s non-negative integers with λ1<λ2<⋯<λs, and let t≥2. A family F...
A k-uniform family of subsets of [n] is intersecting if it does not contain a disjoint pair of sets....
AbstractLet n⩾t⩾1 be integers. Let F, G be families of subsets of the n-element set X. They are call...
Let us write DF (G) = {F ∈ F: F ∩ G = ∅} for a set G and a family F. Then a family F of sets is sai...
AbstractLet X = [1, n] be a finite set of cardinality n and let F be a family of k-subsets of X. Sup...
We call a family of sets intersecting, if any two sets in the family intersect. In this paper we inv...
We call a family of sets intersecting, if any two sets in the family intersect. In this paper we inv...
AbstractWe determine the maximum size of uniform intersecting families with covering number at least...
Let $n > k > 1$ be integers, $[n] = \{1, \ldots, n\}$. Let $\mathcal F$ be a family of $k$-subsets o...
A family A of sets is said to be intersecting if any two sets in A intersect. Families A1,...,Ap are...
A family $\mathcal F$ has covering number $\tau$ if the size of the smallest set intersecting all se...
AbstractA family F is intersecting if F∩F′≠∅ whenever F,F′∈F. Erdős, Ko, and Rado (1961) [6] showed ...
AbstractWe discuss the maximum size of uniform intersecting families with covering number at leastτ....
A family J of subsets of {1,..., n} is called a j-junta if there exists J ⊆ {1,..., n}, with |J | =...
AbstractLet H denote the set {f1,f2,…,fn}, 2[n] the collection of all subsets of H and F⊆2[n] be a f...
AbstractLet L={λ1,…,λs} be a set of s non-negative integers with λ1<λ2<⋯<λs, and let t≥2. A family F...
A k-uniform family of subsets of [n] is intersecting if it does not contain a disjoint pair of sets....
AbstractLet n⩾t⩾1 be integers. Let F, G be families of subsets of the n-element set X. They are call...
Let us write DF (G) = {F ∈ F: F ∩ G = ∅} for a set G and a family F. Then a family F of sets is sai...
AbstractLet X = [1, n] be a finite set of cardinality n and let F be a family of k-subsets of X. Sup...
We call a family of sets intersecting, if any two sets in the family intersect. In this paper we inv...
We call a family of sets intersecting, if any two sets in the family intersect. In this paper we inv...
AbstractWe determine the maximum size of uniform intersecting families with covering number at least...
Add to ORKG