On the algebraic and topological structure of the set of Turán densities
From MaRDI portal
Publication:256996
DOI10.1016/J.JCTB.2016.01.001zbMATH Open1332.05103arXiv1403.4653OpenAlexW3101763309MaRDI QIDQ256996FDOQ256996
Authors: Codruţ Grosu 
Publication date: 14 March 2016
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Abstract: The present paper is concerned with the various algebraic structures supported by the set of Tur'an densities. We prove that the set of Tur'an densities of finite families of r-graphs is a non-trivial commutative semigroup, and as a consequence we construct explicit irrational densities for any r >= 3. The proof relies on a technique recently developed by Pikhurko. We also show that the set of all Tur'an densities forms a graded ring, and from this we obtain a short proof of a theorem of Peng on jumps of hypergraphs. Finally, we prove that the set of Tur'an densities of families of r-graphs has positive Lebesgue measure if and only if it contains an open interval. This is a simple consequence of Steinhaus's theorem.
Full work available at URL: https://arxiv.org/abs/1403.4653
Recommendations
Extremal problems in graph theory (05C35) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Density (toughness, etc.) (05C42) Hypergraphs (05C65)
Cites Work
- Van der Waerden/Schrijver-Valiant like conjectures and stable (aka hyperbolic) homogeneous polynomials: one theorem for all
- Using Lagrangians of hypergraphs to find non-jumping numbers. I
- A note on a conjecture on permanents
- On a conjecture of E. Dittert
- Hypergraphs do not jump
- Asymptotic solution of the Turán problem for some hypergraphs
- On the number of pentagons in triangle-free graphs
- On a hypergraph Turán problem of Frankl
- On extremal problems of graphs and generalized graphs
- Hypergraph regularity and the multidimensional Szemerédi theorem
- On the Erdős-Volkmann and Katz-Tao ring conjectures
- On some extremal problems on \(r\)-graphs
- Non-three-colourable common graphs exist
- On 3-hypergraphs with forbidden 4-vertex configurations
- Hypergraphs do jump
- Title not available (Why is that?)
- Daisies and other Turán problems
- A Solution to the 2/3 Conjecture
- Title not available (Why is that?)
- ON THE LINEAR INDEPENDENCE OF ROOTS
- Betti Numbers of Hypergraphs
- A problem related to the van der waerden permanent theorem*
- Random access communication and graph entropy
- Title not available (Why is that?)
- Title not available (Why is that?)
- New Turán densities for 3-graphs
- Title not available (Why is that?)
- On possible Turán densities
- Theory of permanents 1978–1981
- Borel subrings of the reals
- Regularity Lemma for k-uniform hypergraphs
- Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs
- A new bound for the 2/3 conjecture
- A note on the Dittert conjecture for permanents
- Flag algebras
- The counting lemma for regular k‐uniform hypergraphs
- Applications of the regularity lemma for uniform hypergraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the structure of linear graphs
- On the maximum number of five-cycles in a triangle-free graph
- Some results towards the Dittert conjecture on permanents
- Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures
- A note on the jumping constant conjecture of Erdős
- Non-jumping numbers for 4-uniform hypergraphs
- Using Lagrangians of hypergraphs to find non-jumping numbers. II.
- The maximal length of a gap between \(r\)-graph Turán densities
- Generating non-jumping numbers recursively
- On jumping densities of hypergraphs
- Generalizations of the removal lemma
Cited In (5)
Uses Software
This page was built for publication: On the algebraic and topological structure of the set of Turán densities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q256996)
