Triple Systems Not Containing a Fano Configuration
From MaRDI portal
Publication:5696359
DOI10.1017/S0963548305006784zbMath1075.05062OpenAlexW2164352160WikidataQ105998326 ScholiaQ105998326MaRDI QIDQ5696359
Zoltan Fueredi, Miklós Simmonovits
Publication date: 18 October 2005
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548305006784
Related Items (44)
Stability theorems for cancellative hypergraphs ⋮ An intersection theorem for four sets ⋮ Pairwise intersections and forbidden configurations ⋮ Codegree problems for projective geometries ⋮ Combinatorial theorems in sparse random sets ⋮ The Codegree Threshold for 3-Graphs with Independent Neighborhoods ⋮ A new generalization of Mantel's theorem to \(k\)-graphs ⋮ Hypergraph Turán densities can have arbitrarily large algebraic degree ⋮ Spectral extremal graphs for the bowtie ⋮ Extremal problems in uniformly dense hypergraphs ⋮ Hypergraphs with many Kneser colorings ⋮ A 2-stable family of triple systems ⋮ Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm ⋮ On the Chromatic Thresholds of Hypergraphs ⋮ New lower bounds for the Turán density of \(PG_m(q)\) ⋮ Stability theorems for some Kruskal-Katona type results ⋮ On the co-degree threshold for the Fano plane ⋮ Almost all triangle-free triple systems are tripartite ⋮ The minimum size of 3-graphs without a 4-set spanning no or exactly three edges ⋮ Turán problems on non-uniform hypergraphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Counting substructures. II: Hypergraphs ⋮ On Colourings of Hypergraphs Without Monochromatic Fano Planes ⋮ Constructions of non-principal families in extremal hypergraph theory ⋮ Simplex Stability ⋮ An exact Turán result for the generalized triangle ⋮ Colorful paths for 3-chromatic graphs ⋮ An Unstable Hypergraph Problem with a Unique Optimal Solution ⋮ Analytic methods for uniform hypergraphs ⋮ Stability results for random discrete structures ⋮ Set systems without a simplex or a cluster ⋮ Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs ⋮ A hypergraph regularity method for generalized Turán problems ⋮ Rainbow Erdös--Rothschild Problem for the Fano Plane ⋮ Unit distances and diameters in Euclidean spaces ⋮ Two-regular subgraphs of hypergraphs ⋮ The Turán problem for projective geometries ⋮ Independent sets in hypergraphs ⋮ Structure and stability of triangle-free set systems ⋮ An expected polynomial time algorithm for coloring 2-colorable 3-graphs ⋮ The co-degree density of the Fano plane ⋮ A hypergraph Turán problem with no stability ⋮ A hypergraph extension of Turán's theorem ⋮ A unified approach to hypergraph stability
This page was built for publication: Triple Systems Not Containing a Fano Configuration
