On the algebraic and topological structure of the set of Turán densities
From MaRDI portal
(Redirected from Publication:256996)
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 5942358 (Why is no real title available?)
- scientific article; zbMATH DE number 3857112 (Why is no real title available?)
- scientific article; zbMATH DE number 3609704 (Why is no real title available?)
- scientific article; zbMATH DE number 1220320 (Why is no real title available?)
- scientific article; zbMATH DE number 1131467 (Why is no real title available?)
- scientific article; zbMATH DE number 3219058 (Why is no real title available?)
- scientific article; zbMATH DE number 3224335 (Why is no real title available?)
- scientific article; zbMATH DE number 3262986 (Why is no real title available?)
- scientific article; zbMATH DE number 3285073 (Why is no real title available?)
- A Solution to the 2/3 Conjecture
- A new bound for the 2/3 conjecture
- A note on a conjecture on permanents
- A note on the Dittert conjecture for permanents
- A note on the jumping constant conjecture of Erdős
- A problem related to the van der waerden permanent theorem*
- Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs
- Applications of the regularity lemma for uniform hypergraphs
- Asymptotic solution of the Turán problem for some hypergraphs
- Betti Numbers of Hypergraphs
- Borel subrings of the reals
- Daisies and other Turán problems
- Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures
- Flag algebras
- Generalizations of the removal lemma
- Generating non-jumping numbers recursively
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Hypergraphs do jump
- Hypergraphs do not jump
- New Turán densities for 3-graphs
- Non-jumping numbers for 4-uniform hypergraphs
- Non-three-colourable common graphs exist
- ON THE LINEAR INDEPENDENCE OF ROOTS
- On 3-hypergraphs with forbidden 4-vertex configurations
- On a conjecture of E. Dittert
- On a hypergraph Turán problem of Frankl
- On extremal problems of graphs and generalized graphs
- On jumping densities of hypergraphs
- On possible Turán densities
- On some extremal problems on r-graphs
- On the Erdős-Volkmann and Katz-Tao ring conjectures
- On the maximum number of five-cycles in a triangle-free graph
- On the number of pentagons in triangle-free graphs
- On the structure of linear graphs
- Random access communication and graph entropy
- Regularity Lemma for k-uniform hypergraphs
- Some results towards the Dittert conjecture on permanents
- The counting lemma for regular k‐uniform hypergraphs
- The maximal length of a gap between r-graph Turán densities
- Theory of permanents 1978–1981
- Using Lagrangians of hypergraphs to find non-jumping numbers. I
- Using Lagrangians of hypergraphs to find non-jumping numbers. II.
- Van der Waerden/Schrijver-Valiant like conjectures and stable (aka hyperbolic) homogeneous polynomials: one theorem for all
Cited in
(5)
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)
