The feasible region of hypergraphs

DOI10.1016/j.jctb.2020.12.004zbMath1459.05226arXiv1911.02090OpenAlexW3117795563MaRDI QIDQ1998756

Xizhi Liu, Dhruv Mubayi

Publication date: 8 March 2021

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1911.02090

zbMATH Keywords

shadowstabilityLagrangianhypergraph Turán problems

Mathematics Subject Classification ID

Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (5)

A 2-stable family of triple systems ⋮ Stability theorems for some Kruskal-Katona type results ⋮ A hypergraph Turán problem with no stability ⋮ A unified approach to hypergraph stability ⋮ The feasible region of induced graphs

Cites Work

• The clique density theorem
• An exact Turán result for the generalized triangle
• Bounds on the number of complete subgraphs
• Three-graphs without two triples whose symmetric difference is contained in a third
• On the boundary of the region defined by homomorphism densities
• Stability theorems for cancellative hypergraphs
• Exact computation of the hypergraph Turán function for expanded complete 2-graphs
• A hypergraph extension of Turán's theorem
• The number of cliques in graphs of given order and size
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On the Minimal Density of Triangles in Graphs
• Flag algebras
• On generalized graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The feasible region of hypergraphs