An exact Turán result for the generalized triangle
From MaRDI portal
Publication:949792
DOI10.1007/s00493-008-2187-2zbMath1175.05137OpenAlexW1989410413MaRDI QIDQ949792
Publication date: 21 October 2008
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-008-2187-2
Related Items
2-Cancellative Hypergraphs and Codes, Symmetry in Turán sums of squares polynomials from flag algebras, An Irrational Lagrangian Density of a Single Hypergraph, Turán number of generalized triangles, Lagrangian densities of some sparse hypergraphs and Turán numbers of their extensions, A hypergraph Turán theorem via Lagrangians of intersecting families, The edit distance function and symmetrization, Turán numbers of extensions, Lagrangian-perfect hypergraphs, \(\lambda\)-perfect hypergraphs and Lagrangian densities of hypergraph cycles, A 2-stable family of triple systems, Lagrangian densities of linear forests and Turán numbers of their extensions, On the Chromatic Thresholds of Hypergraphs, Stability and Turán Numbers of a Class of Hypergraphs via Lagrangians, Stability theorems for some Kruskal-Katona type results, The minimum size of 3-graphs without a 4-set spanning no or exactly three edges, Hypergraphs with independent neighborhoods, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Counting substructures. II: Hypergraphs, On \(k\)-uniform random hypergraphs without generalized fans, The feasible region of hypergraphs, Stability results for random discrete structures, Set systems without a simplex or a cluster, Unnamed Item, Forbidden configurations: boundary cases, The Lagrangian density of \(\{123, 234, 456\}\) and the Turán number of its extension, Lagrangian densities of enlargements of matchings in hypergraphs, Lagrangian densities of short 3-uniform linear paths and Turán numbers of their extensions, A hypergraph Turán problem with no stability, A unified approach to hypergraph stability, A hypergraph Turán theorem via Lagrangians of intersecting families
Cites Work
- Unnamed Item
- Unnamed Item
- Supersaturated graphs and hypergraphs
- Extremal problems whose solutions are the blowups of the small Witt- designs
- A variant of the hypergraph removal lemma
- A new generalization of Mantel's theorem to \(k\)-graphs
- On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs
- Three-graphs without two triples whose symmetric difference is contained in a third
- Stability theorems for cancellative hypergraphs
- The Turán number of the Fano plane
- On a hypergraph Turán problem of Frankl
- Regularity Lemma for k-uniform hypergraphs
- The counting lemma for regular k‐uniform hypergraphs
- Applications of the regularity lemma for uniform hypergraphs
- Triple Systems Not Containing a Fano Configuration
- A new generalization of the Erdős-Ko-Rado theorem