Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs
From MaRDI portal
Publication:4903261
Recommendations
- New Turán densities for 3-graphs
- Turán \(H\)-densities for 3-graphs
- The Turán density problem for hypergraphs
- On the Turán density of \(\{1, 3\}\)-hypergraphs
- scientific article; zbMATH DE number 3924792
- scientific article; zbMATH DE number 4200237
- On Turán densities of small triple graphs
- A hypergraph regularity method for generalized Turán problems
- A note on a Turán-type extremal question on 3-graphs
- A note on the structure of Turán densities of hypergraphs
Cites work
- A class of constructions for Turan's (3,4)-problem
- A new generalization of the Erdős-Ko-Rado theorem
- An analytic approach to stability
- An exact result for 3-graphs
- CSDP, A C library for semidefinite programming
- Constructions of non-principal families in extremal hypergraph theory
- Daisies and other Turán problems
- Flag algebras
- Generalizations of the removal lemma
- Hypergraphs do jump
- Method for construction of (3,4)-graphs
- On 3-hypergraphs with forbidden 4-vertex configurations
- On Triple Systems with Independent Neighbourhoods
- On the Fon-Der-Flaass interpretation of extremal examples for Turán's \((3,4)\)-problem
- On the Turán number of triple systems
- On the maximum number of five-cycles in a triangle-free graph
- On the structure of linear graphs
- The Turán density of triple systems is not principal
- The Turán number of \(F_{3,3}\)
- The maximum size of 3-uniform hypergraphs not containing a Fano plane
- Three-graphs without two triples whose symmetric difference is contained in a third
- What we know and what we do not know about Turán numbers
Cited in
(30)- On the codegree density of complete 3-graphs and related problems
- The density Turan problem for 3-uniform linear hypertrees. An efficient testing algorithm
- On the maximum density of fixed strongly connected subtournaments
- Simple graph density inequalities with no sum of squares proofs
- On the Caccetta-Häggkvist conjecture with a forbidden transitive tournament
- Tropicalization of graph profiles
- On the maximum quartet distance between phylogenetic trees
- On the algebraic and topological structure of the set of Turán densities
- New Turán densities for 3-graphs
- On possible Turán densities
- Triangle-degrees in graphs and tetrahedron coverings in 3-graphs
- Symmetric sums of squares over \(k\)-subset hypercubes
- Turán \(H\)-densities for 3-graphs
- On the inducibility of oriented graphs on four vertices
- Maximum number of almost similar triangles in the plane
- The codegree threshold for 3-graphs with independent neighborhoods
- Minimum number of edges that occur in odd cycles
- Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm
- Lower bounds for the Turán densities of daisies
- Universality of graphs with few triangles and anti-triangles
- Minimum Number ofk-Cliques in Graphs with Bounded Independence Number
- Minimum Number of Monotone Subsequences of Length 4 in Permutations
- A hypergraph Turán problem with no stability
- A note on the inducibility of 4-vertex graphs
- Symmetry in Turán sums of squares polynomials from flag algebras
- Maximizing five-cycles in \(K_r\)-free graphs
- Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting)
- Almost similar configurations
- On Turán's \((3,4)\)-problem with forbidden subgraphs
- On crossing numbers of complete tripartite and balanced complete multipartite graphs
This page was built for publication: Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4903261)
