Hypergraph Turán densities can have arbitrarily large algebraic degree

DOI10.1016/J.JCTB.2023.03.003zbMATH Open1512.05313arXiv2207.05576OpenAlexW4362631200MaRDI QIDQ6038595FDOQ6038595

Authors: Xizhi Liu, Oleg Pikhurko 

Publication date: 2 May 2023

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

Abstract: Grosu [On the algebraic and topological structure of the set of Tur'{a}n densities. emph{J. Combin. Theory Ser. B} extbf{118} (2016) 137--185] asked if there exist an integer $rge3$ and a finite family of $r$-graphs whose Tur'{a}n density, as a real number, has (algebraic) degree greater than~$r-1$. In this note we show that, for all integers $rge3$ and $d$, there exists a finite family of $r$-graphs whose Tur'{a}n density has degree at least~$d$, thus answering Grosu's question in a strong form.

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

Recommendations

• The Turán density problem for hypergraphs
• A note on the structure of Turán densities of hypergraphs
• Hypergraphs with vanishing Turán density in uniformly dense hypergraphs
• Turán densities of some hypergraphs related to \(K_{k+1}^{k}\)
• On the Turán density of uniform hypergraphs
• The Turán density of the hypergraph \(\{abc,ade,bde,cde\}\)
• A hypergraph extension of Turán's theorem
• Degenerate Turán densities of sparse hypergraphs
• An irrational Turán density via hypergraph Lagrangian densities
• Turánnical hypergraphs

zbMATH Keywords

patternalgebraic degreeTurán densityhypergraph Turán problem

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• On the algebraic and topological structure of the set of Turán densities
• Hypergraphs with vanishing Turán density in uniformly dense hypergraphs
• Generating non-jumps from a known one
• Turán problems for mixed graphs

This page was built for publication: Hypergraph Turán densities can have arbitrarily large algebraic degree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6038595)