Stability theorems for cancellative hypergraphs
From MaRDI portal
Publication:1880797
DOI10.1016/j.jctb.2004.05.003zbMath1052.05051OpenAlexW2110639574MaRDI QIDQ1880797
Publication date: 1 October 2004
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2004.05.003
Related Items
2-Cancellative Hypergraphs and Codes ⋮ The Turán Number ofF3,3 ⋮ Pairwise intersections and forbidden configurations ⋮ Turán number of generalized triangles ⋮ A new generalization of Mantel's theorem to \(k\)-graphs ⋮ An exact Turán result for tripartite 3-graphs ⋮ On the independence numbers of the cubes of odd cycles ⋮ Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths ⋮ Extremal graphs for odd wheels ⋮ On Turán numbers for disconnected hypergraphs ⋮ Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm ⋮ Some Cubic Time Regularity Algorithms for Triple Systems ⋮ On the Chromatic Thresholds of Hypergraphs ⋮ Stability and Turán Numbers of a Class of Hypergraphs via Lagrangians ⋮ Stability theorems for some Kruskal-Katona type results ⋮ Almost all triangle-free triple systems are tripartite ⋮ The minimum size of 3-graphs without a 4-set spanning no or exactly three edges ⋮ Hypergraphs with independent neighborhoods ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Shattered matchings in intersecting hypergraphs ⋮ Counting substructures. II: Hypergraphs ⋮ Simplex Stability ⋮ An exact Turán result for the generalized triangle ⋮ On \(k\)-uniform random hypergraphs without generalized fans ⋮ The feasible region of hypergraphs ⋮ Stability results for random discrete structures ⋮ Set systems without a simplex or a cluster ⋮ Mantel's theorem for random hypergraphs ⋮ 4-books of three pages ⋮ Tight bounds on the coefficients of partition functions via stability ⋮ New short proofs to some stability theorems ⋮ Independent sets in hypergraphs ⋮ Maximum Size Intersecting Families of Bounded Minimum Positive Co-degree ⋮ A hypergraph extension of Turán's theorem ⋮ A unified approach to hypergraph stability
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs
- Three-graphs without two triples whose symmetric difference is contained in a third
- The maximum size of 3-uniform hypergraphs not containing a Fano plane
- On the Turán number of triple systems
- What we know and what we do not know about Turán numbers
- A new construction for cancellative families of sets
- The Turán number of the Fano plane
- On a hypergraph Turán problem of Frankl
- Triple Systems Not Containing a Fano Configuration
- A new generalization of the Erdős-Ko-Rado theorem
This page was built for publication: Stability theorems for cancellative hypergraphs
