A new generalization of the Erdős-Ko-Rado theorem
From MaRDI portal
Publication:5896187
DOI10.1007/BF02579190zbMath0529.05001OpenAlexW2395767617MaRDI QIDQ5896187
Publication date: 1983
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02579190
Related Items
Stability theorems for cancellative hypergraphs, Erdős--Ko--Rado for three sets, An intersection theorem for four sets, Mini-workshop: Hypergraph Turán problem. Abstracts from the mini-workshop held April 8--14, 2012., Turán number of generalized triangles, Some Ramsey-Turán type results for hypergraphs, Exact solution of some Turán-type problems, A new generalization of Mantel's theorem to \(k\)-graphs, Structural results for conditionally intersecting families and some applications, An exact Turán result for tripartite 3-graphs, \(\lambda\)-perfect hypergraphs and Lagrangian densities of hypergraph cycles, On Turán densities of small triple graphs, Uniform hypergraphs under certain intersection constraints between hyperedges, On the maximum \(F_5\)-free subhypergraphs of a random hypergraph, Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm, On Multicolor Ramsey Numbers of Triple System Paths of Length 3, Some Cubic Time Regularity Algorithms for Triple Systems, Restricted problems in extremal combinatorics, On the Chromatic Thresholds of Hypergraphs, Stability and Turán Numbers of a Class of Hypergraphs via Lagrangians, Unavoidable subhypergraphs: \(\mathbf a\)-clusters, Almost all triangle-free triple systems are tripartite, Families of finite sets in which no set is covered by the union of two others, Hypergraphs with independent neighborhoods, Turán problems on non-uniform hypergraphs, Shattered matchings in intersecting hypergraphs, Counting substructures. II: Hypergraphs, Chromatic Turán problems and a new upper bound for the Turán density of \(\mathcal K^{-}_{4}\), New results on simplex-clusters in set systems, Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs, Simplex Stability, An exact Turán result for the generalized triangle, On \(k\)-uniform random hypergraphs without generalized fans, A structural result for 3-graphs, Set systems without a simplex or a cluster, Mantel's theorem for random hypergraphs, On set systems without a simplex-cluster and the junta method, 4-books of three pages, Asymptotic solution of a Turán-type problem, On Mubayi's Conjecture and Conditionally Intersecting Sets, On the \(d\)-cluster generalization of Erdős-Ko-Rado, Invitation to intersection problems for finite sets, Set systems with union and intersection constraints, Hypergraphs in which all disjoint pairs have distinct unions, \(d\)-cluster-free sets with a given matching number, Maximum Size Intersecting Families of Bounded Minimum Positive Co-degree, Unavoidable subhypergraphs: a-clusters, An exact result for 3-graphs, Extremal problems whose solutions are the blowups of the small Witt- designs, On the Turán number of triple systems
Cites Work
- Unnamed Item
- Three-graphs without two triples whose symmetric difference is contained in a third
- On Sperner families satisfying an additional condition
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- On families of finite sets no two of which intersect in a singleton
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
