The maximal length of a gap between \(r\)-graph Turán densities

zbMath1323.05078arXiv1504.00769MaRDI QIDQ888628

Oleg Pikhurko

Publication date: 2 November 2015

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

hypergraphsTurán function

Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal set theory (05D05) Density (toughness, etc.) (05C42)

Related Items

Hypergraph Turán densities can have arbitrarily large algebraic degree, On the algebraic and topological structure of the set of Turán densities

Cites Work

• On possible Turán densities
• Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures
• Hypergraphs do not jump
• What we know and what we do not know about Turán numbers
• On extremal problems of graphs and generalized graphs
• Hypergraphs Do Jump
• On the structure of linear graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item