On 3-Hypergraphs with Forbidden 4-Vertex Configurations
From MaRDI portal
Publication:3008019
DOI10.1137/090747476zbMath1223.05204OpenAlexW2034871182MaRDI QIDQ3008019
Publication date: 17 June 2011
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/090747476
Semidefinite programming (90C22) Hypergraphs (05C65) Extremal combinatorics (05D99) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25)
Related Items (63)
A problem of Erdős and Sós on 3-graphs ⋮ Finitely forcible graph limits are universal ⋮ Symmetry in Turán sums of squares polynomials from flag algebras ⋮ Unnamed Item ⋮ Non-Three-Colourable Common Graphs Exist ⋮ Embedding tetrahedra into quasirandom hypergraphs ⋮ An Irrational Lagrangian Density of a Single Hypergraph ⋮ Mini-workshop: Hypergraph Turán problem. Abstracts from the mini-workshop held April 8--14, 2012. ⋮ Tournaments, 4-uniform hypergraphs, and an exact extremal result ⋮ Counting \(r\)-graphs without forbidden configurations ⋮ The Turán polytope ⋮ The Codegree Threshold for 3-Graphs with Independent Neighborhoods ⋮ An exact Turán result for tripartite 3-graphs ⋮ Tropicalization of graph profiles ⋮ Extremal problems in uniformly dense hypergraphs ⋮ Turán numbers T(n,5,3) $T(n,5,3)$ and graphs without induced 5‐cycles ⋮ Turán, involution and shifting ⋮ Lagrangian-perfect hypergraphs ⋮ The codegree threshold of \(K_4^-\) ⋮ On Turán densities of small triple graphs ⋮ On Turán numbers for disconnected hypergraphs ⋮ Uniform Turán density of cycles ⋮ A 2-stable family of triple systems ⋮ Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm ⋮ F$F$‐factors in Quasi‐random Hypergraphs ⋮ Four-vertex traces of finite sets ⋮ Breaking symmetries to rescue sum of squares in the case of makespan scheduling ⋮ On the Turán density of uniform hypergraphs ⋮ Restricted problems in extremal combinatorics ⋮ 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 ⋮ Finitely forcible graphons with an almost arbitrary structure ⋮ A new lower bound based on Gromov's method of selecting heavily covered points ⋮ The minimum size of 3-graphs without a 4-set spanning no or exactly three edges ⋮ Strong forms of stability from flag algebra calculations ⋮ Monochromatic triangles in three-coloured graphs ⋮ On possible Turán densities ⋮ Simple graph density inequalities with no sum of squares proofs ⋮ Turán problems on non-uniform hypergraphs ⋮ Finitely forcible graphons and permutons ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ On the maximum density of fixed strongly connected subtournaments ⋮ Minimum Number ofk-Cliques in Graphs with Bounded Independence Number ⋮ On Perfect Matchings and Tilings in Uniform Hypergraphs ⋮ Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs ⋮ Induced Turán Numbers ⋮ The Inducibility of Graphs on Four Vertices ⋮ Two Questions of Erdős on Hypergraphs above the Turán Threshold ⋮ Counting flags in triangle-free digraphs ⋮ A New Bound for the 2/3 Conjecture ⋮ On local Turán problems ⋮ On the maximum number of five-cycles in a triangle-free graph ⋮ On the Fon-Der-Flaass interpretation of extremal examples for Turán's \((3,4)\)-problem ⋮ On the Maximum Quartet Distance between Phylogenetic Trees ⋮ A problem of Erdős on the minimum number of \(k\)-cliques ⋮ Weak regularity and finitely forcible graph limits ⋮ On the 3‐Local Profiles of Graphs ⋮ Compactness and finite forcibility of graphons ⋮ On the Caccetta-Häggkvist Conjecture with Forbidden Subgraphs ⋮ Turán’s Brick Factory Problem: The Status of the Conjectures of Zarankiewicz and Hill ⋮ 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
This page was built for publication: On 3-Hypergraphs with Forbidden 4-Vertex Configurations
