Hypergraph Turán densities can have arbitrarily large algebraic degree

DOI10.1016/j.jctb.2023.03.003zbMath1512.05313arXiv2207.05576OpenAlexW4362631200MaRDI QIDQ6038595

Oleg Pikhurko, Xizhi Liu

Publication date: 2 May 2023

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

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

zbMATH Keywords

patternalgebraic degreeTurán densityhypergraph Turán problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Density (toughness, etc.) (05C42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the algebraic and topological structure of the set of Turán densities
• New Turán densities for 3-graphs
• On possible Turán densities
• A note on the jumping constant conjecture of Erdős
• The maximal length of a gap between \(r\)-graph Turán densities
• Hypergraphs do not jump
• The maximum size of 3-uniform hypergraphs not containing a Fano plane
• What we know and what we do not know about Turán numbers
• Non-jumping Turán densities of hypergraphs
• The Turán number of the Fano plane
• On extremal problems of graphs and generalized graphs
• Hypergraphs Do Jump
• An Irrational Lagrangian Density of a Single Hypergraph
• Maxima for Graphs and a New Proof of a Theorem of Turán
• Triple Systems Not Containing a Fano Configuration
• On the structure of linear graphs