On Sperner families satisfying an additional condition
From MaRDI portal
Publication:1226485
DOI10.1016/0097-3165(76)90073-XzbMath0328.05002MaRDI QIDQ1226485
Publication date: 1976
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Related Items
On the upper bound of the size of the \(r\)-cover-free families, More complete intersection theorems, Hypergraphs without non-trivial intersecting subgraphs, Erdős--Ko--Rado for three sets, On the Erdős-Ko-Rado theorem and the Bollobás theorem for \(t\)-intersecting families, The \((p, q)\)-extremal problem and the fractional chromatic number of Kneser hypergraphs, Finite projective spaces and intersecting hypergraphs, Multiply-intersecting families revisited, Exact solution of some Turán-type problems, EKR type inequalities for 4-wise intersecting families, Some results on Sperner families, On Sperner families in which no k sets have an empty intersection, Structural results for conditionally intersecting families and some applications, Triangles in intersecting families, On \(q\)-analogues and stability theorems, Non-trivial \(r\)-wise intersecting families, Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022, The structure of maximal non-trivial \(d\)-wise intersecting uniform families with large sizes, A proof of Frankl's conjecture on cross-union families, Sperner type theorems and complexity of minimal disjunctive normal forms of monotone Boolean functions, On Sperner families in which no k sets have an empty intersection. II, Unavoidable subhypergraphs: \(\mathbf a\)-clusters, On a problem of Chvatal and Erdoes on hypergraphs containing no generalized simplex, Theorems of Erdős-Ko-Rado type in geometrical settings, High dimensional Hoffman bound and applications in extremal combinatorics, The maximum measure of 3-wise \(t\)-intersecting families, Shadows and intersections in vector spaces, Clone-induced approximation algebras of Bernoulli distributions, On Sperner families in which no k sets have an empty intersection. III, Ryser's conjecture for \(t\)-intersecting hypergraphs, A new generalization of the Erdős-Ko-Rado theorem, New results on simplex-clusters in set systems, The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture, Coding for a multiple access OR channel: A survey, A structural result for 3-graphs, A multiply intersecting Erdős-Ko-Rado theorem -- the principal case, Set systems without a simplex or a cluster, A product version of the Erdős-Ko-Rado theorem, Random walks and multiply intersecting families, On set systems without a simplex-cluster and the junta method, Erdös–Ko–Rado Theorem—22 Years Later, The maximum size of 4-wise 2-intersecting and 4-wise 2-union families, The maximum size of 3-wise intersecting and 3-wise union families, On Mubayi's Conjecture and Conditionally Intersecting Sets, Old and new applications of Katona's circle, On the \(d\)-cluster generalization of Erdős-Ko-Rado, Invitation to intersection problems for finite sets, On the arithmetic mean of the size of cross-union families, On ordered set systems and some conjectures related to the erdös–ko–rado theorem and turán's theorem, On r-Cross Intersecting Families of Sets, \(d\)-cluster-free sets with a given matching number, Structure and stability of triangle-free set systems, Extremal problems concerning Kneser-graphs, An extension of the Erdős–Ko–Rado Theorem, Weighted 3-wise 2-intersecting families, Families of finite sets in which no set is covered by the union of \(r\) others, Polytopes determined by hypergraph classes
Cites Work
