Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs

DOI10.1017/S0963548312000508zbMath1257.05077OpenAlexW2007709851WikidataQ60692306 ScholiaQ60692306MaRDI QIDQ4903261

Victor Falgas-Ravry, Emil R. Vaughan

Publication date: 21 January 2013

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548312000508

zbMATH Keywords

FlagmaticRazborov's semi-definite method

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Extremal set theory (05D05) Density (toughness, etc.) (05C42)

Related Items

A problem of Erdős and Sós on 3-graphs, On the inducibility of oriented graphs on four vertices, Symmetry in Turán sums of squares polynomials from flag algebras, Almost similar configurations, Maximum number of almost similar triangles in the plane, The Codegree Threshold for 3-Graphs with Independent Neighborhoods, Tropicalization of graph profiles, On the codegree density of complete 3-graphs and related problems, The codegree threshold of \(K_4^-\), Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm, Lower bounds for the Turán densities of daisies, Minimum Number of Monotone Subsequences of Length 4 in Permutations, Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting), Symmetric sums of squares over \(k\)-subset hypercubes, Universality of Graphs with Few Triangles and Anti-Triangles, On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs, On possible Turán densities, Simple graph density inequalities with no sum of squares proofs, On the maximum density of fixed strongly connected subtournaments, Minimum Number ofk-Cliques in Graphs with Bounded Independence Number, A note on the inducibility of 4-vertex graphs, On the Caccetta-Häggkvist conjecture with a forbidden transitive tournament, On the Maximum Quartet Distance between Phylogenetic Trees, Maximizing five-cycles in \(K_r\)-free graphs, Minimum number of edges that occur in odd cycles, Triangle-degrees in graphs and tetrahedron coverings in 3-graphs, A hypergraph Turán problem with no stability, On Turán's \((3,4)\)-problem with forbidden subgraphs, On the algebraic and topological structure of the set of Turán densities

Uses Software

• Flagmatic

Cites Work

• An analytic approach to stability
• On the maximum number of five-cycles in a triangle-free graph
• An exact result for 3-graphs
• Constructions of non-principal families in extremal hypergraph theory
• Generalizations of the removal lemma
• A class of constructions for Turan's (3,4)-problem
• Method for construction of (3,4)-graphs
• Three-graphs without two triples whose symmetric difference is contained in a third
• The maximum size of 3-uniform hypergraphs not containing a Fano plane
• On the Turán number of triple systems
• The Turán density of triple systems is not principal
• What we know and what we do not know about Turán numbers
• On the Fon-Der-Flaass interpretation of extremal examples for Turán's \((3,4)\)-problem
• The Turán Number ofF_3,3
• On 3-Hypergraphs with Forbidden 4-Vertex Configurations
• Hypergraphs Do Jump
• Daisies and Other Turán Problems
• CSDP, A C library for semidefinite programming
• Flag algebras
• On Triple Systems with Independent Neighbourhoods
• On the structure of linear graphs
• A new generalization of the Erdős-Ko-Rado theorem