On the algebraic and topological structure of the set of Turán densities
From MaRDI portal
Publication:256996
DOI10.1016/j.jctb.2016.01.001zbMath1332.05103arXiv1403.4653OpenAlexW3101763309MaRDI QIDQ256996
Publication date: 14 March 2016
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1403.4653
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Density (toughness, etc.) (05C42)
Related Items
Hypergraph Turán densities can have arbitrarily large algebraic degree ⋮ Lagrangian-perfect hypergraphs ⋮ An Extremal Graph Problem with a Transcendental Solution
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New Turán densities for 3-graphs
- On possible Turán densities
- 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
- 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
- Daisies and Other Turán Problems
- A Solution to the 2/3 Conjecture
- 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
- 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
- On the structure of linear graphs
