A new generalization of Mantel's theorem to \(k\)-graphs
From MaRDI portal
Publication:885302
DOI10.1016/j.jctb.2006.11.003zbMath1153.05032OpenAlexW2109179031MaRDI QIDQ885302
Publication date: 8 June 2007
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2006.11.003
Related Items
The exact linear Turán number of the sail, Lagrangian densities of some sparse hypergraphs and Turán numbers of their extensions, Independent sets in hypergraphs omitting an intersection, Uniform hypergraphs with many edge‐colorings avoiding a fixed rainbow expanded complete graph, Stability of extremal hypergraphs with applications to an edge-coloring problem, A 2-stable family of triple systems, Stability and Turán Numbers of a Class of Hypergraphs via Lagrangians, The minimum size of 3-graphs without a 4-set spanning no or exactly three edges, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Counting substructures. II: Hypergraphs, Constructions of non-principal families in extremal hypergraph theory, An exact Turán result for the generalized triangle, On \(k\)-uniform random hypergraphs without generalized fans, Set systems without a simplex or a cluster, Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs, An analytic approach to stability, Stability of the Potential Function, Rainbow Erdös--Rothschild Problem for the Fano Plane, The Lagrangian density of \(\{123, 234, 456\}\) and the Turán number of its extension, Unit distances and diameters in Euclidean spaces, Spectral extremal results for hypergraphs, An Extension of Mantel’s Theorem to k-Graphs, Two-regular subgraphs of hypergraphs, Stability Results for Two Classes of Hypergraphs, Structure and stability of triangle-free set systems, A hypergraph Turán problem with no stability, A unified approach to hypergraph stability
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extremal problems whose solutions are the blowups of the small Witt- designs
- On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs
- Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors
- Three-graphs without two triples whose symmetric difference is contained in a third
- Stability theorems for cancellative hypergraphs
- A new construction for cancellative families of sets
- Asymptotic solution of a Turán-type problem
- The Turán number of the Fano plane
- On a hypergraph Turán problem of Frankl
- A hypergraph extension of Turán's theorem
- 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
