Non-degenerate hypergraphs with exponentially many extremal constructions
Authors:
- József BaloghJBJózsef Balogh
- Felix Christian ClemenFCFelix Christian Clemen
- Haoran LuoHLHaoran Luo
- 13 June 2025
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 175, 1-28
Abstract
No abstract availableAll Related Versions
Funding Information
- University of Illinois at Urbana-Champaign
- Simons Foundation
- National Science Foundation (DMS-1764123)
- National Science Foundation (RTG DMS-1937241)
- National Science Foundation (DMS-1937241)
- Campus Research Board (RB 22000)
This publication has 11 references indexed in Scilit:
- A Hypergraph Turán Problem with No StabilityCombinatorica, 2022
- Hypergraph regularity and the multidimensional Szemerédi theoremAnnals of Mathematics, 2007
- The hypergraph regularity method and its applicationsProceedings of the National Academy of Sciences, 2005
- Stability theorems for cancellative hypergraphsJournal of Combinatorial Theory, Series B, 2004
- A new generalization of the Erdős-Ko-Rado theoremCombinatorica, 1983
- On the existence of 2-designs Sλ(2, 3, υ) without repeated blocksDiscrete Mathematics, 1983
- A class of constructions for turán’s (3, 4)-problemCombinatorica, 1982
- Three-graphs without two triples whose symmetric difference is contained in a thirdDiscrete Mathematics, 1974
- An extremal graph problemActa Mathematica Hungarica, 1972
- On the structure of linear graphsBulletin of the American Mathematical Society, 1946