Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs
From MaRDI portal
Publication:4903261
DOI10.1017/S0963548312000508zbMath1257.05077WikidataQ60692306 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
05C65: Hypergraphs
68R10: Graph theory (including graph drawing) in computer science
05D05: Extremal set theory
05C42: Density (toughness, etc.)
Related Items
Triangle-degrees in graphs and tetrahedron coverings in 3-graphs, Almost similar configurations, Tropicalization of graph profiles, Minimum Number of Monotone Subsequences of Length 4 in Permutations, Universality of Graphs with Few Triangles and Anti-Triangles, Minimum Number ofk-Cliques in Graphs with Bounded Independence Number, Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm, On the algebraic and topological structure of the set of Turán densities, A problem of Erdős and Sós on 3-graphs, On the codegree density of complete 3-graphs and related problems, On possible Turán densities, A note on the inducibility of 4-vertex graphs, On the Caccetta-Häggkvist conjecture with a forbidden transitive tournament, Symmetry in Turán sums of squares polynomials from flag algebras, The codegree threshold of \(K_4^-\), Symmetric sums of squares over \(k\)-subset hypercubes, On the maximum density of fixed strongly connected subtournaments, Maximizing five-cycles in \(K_r\)-free graphs, A hypergraph Turán problem with no stability, On the inducibility of oriented graphs on four vertices, Maximum number of almost similar triangles in the plane, Simple graph density inequalities with no sum of squares proofs, Minimum number of edges that occur in odd cycles, On Turán's \((3,4)\)-problem with forbidden subgraphs, Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting), On the Maximum Quartet Distance between Phylogenetic Trees, The Codegree Threshold for 3-Graphs with Independent Neighborhoods, On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs
Uses Software
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 ofF3,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
