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

From MaRDI portal
Publication:4903261

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




Related Items (29)

A problem of Erdős and Sós on 3-graphsOn the inducibility of oriented graphs on four verticesSymmetry in Turán sums of squares polynomials from flag algebrasAlmost similar configurationsMaximum number of almost similar triangles in the planeThe Codegree Threshold for 3-Graphs with Independent NeighborhoodsTropicalization of graph profilesOn the codegree density of complete 3-graphs and related problemsThe codegree threshold of \(K_4^-\)Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐normLower bounds for the Turán densities of daisiesMinimum Number of Monotone Subsequences of Length 4 in PermutationsGeometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting)Symmetric sums of squares over \(k\)-subset hypercubesUniversality of Graphs with Few Triangles and Anti-TrianglesOn Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite GraphsOn possible Turán densitiesSimple graph density inequalities with no sum of squares proofsOn the maximum density of fixed strongly connected subtournamentsMinimum Number ofk-Cliques in Graphs with Bounded Independence NumberA note on the inducibility of 4-vertex graphsOn the Caccetta-Häggkvist conjecture with a forbidden transitive tournamentOn the Maximum Quartet Distance between Phylogenetic TreesMaximizing five-cycles in \(K_r\)-free graphsMinimum number of edges that occur in odd cyclesTriangle-degrees in graphs and tetrahedron coverings in 3-graphsA hypergraph Turán problem with no stabilityOn Turán's \((3,4)\)-problem with forbidden subgraphsOn the algebraic and topological structure of the set of Turán densities


Uses Software


Cites Work


This page was built for publication: Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs