Triple Systems Not Containing a Fano Configuration
From MaRDI portal
Publication:5696359
DOI10.1017/S0963548305006784zbMATH Open1075.05062OpenAlexW2164352160WikidataQ105998326 ScholiaQ105998326MaRDI QIDQ5696359FDOQ5696359
Authors: Zoltán Füredi, Miklós Simonovits 
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
Recommendations
Cited In (51)
- Title not available (Why is that?)
- Stability theorems for some Kruskal-Katona type results
- Stability theorems for cancellative hypergraphs
- On the Chromatic Thresholds of Hypergraphs
- On Triple Systems with Independent Neighbourhoods
- Hypergraphs with many Kneser colorings
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Independent sets in hypergraphs
- Combinatorial theorems in sparse random sets
- Unit distances and diameters in Euclidean spaces
- The asymptotic number of triple systems not containing a fixed one
- Codegree problems for projective geometries
- The minimum size of 3-graphs without a 4-set spanning no or exactly three edges
- An expected polynomial time algorithm for coloring 2-colorable 3-graphs
- A unified approach to hypergraph stability
- Turán problems on non-uniform hypergraphs
- Two-regular subgraphs of hypergraphs
- Simplex stability
- Hypergraph Turán densities can have arbitrarily large algebraic degree
- A hypergraph extension of Turán's theorem
- The codegree threshold for 3-graphs with independent neighborhoods
- On colourings of hypergraphs without monochromatic Fano planes
- Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm
- An unstable hypergraph problem with a unique optimal solution
- Exact results on the number of restricted edge colorings for some families of linear hypergraphs
- Almost all triangle-free triple systems are tripartite
- Rainbow Erdös-Rothschild problem for the Fano plane
- Counting substructures. II: Hypergraphs
- Analytic methods for uniform hypergraphs
- On the co-degree threshold for the Fano plane
- The co-degree density of the Fano plane
- Set systems without a simplex or a cluster
- New lower bounds for the Turán density of \(PG_m(q)\)
- Spectral extremal graphs for the bowtie
- Pairwise intersections and forbidden configurations
- Generating non-jumps from a known one
- Constructions of non-principal families in extremal hypergraph theory
- Triple systems with no three triples spanning at most five points
- Structure and stability of triangle-free set systems
- Stability results for random discrete structures
- A hypergraph regularity method for generalized Turán problems
- A hypergraph Turán problem with no stability
- Turán and Ramsey numbers in linear triple systems
- A new generalization of Mantel's theorem to \(k\)-graphs
- Colorful paths for 3-chromatic graphs
- An exact Turán result for the generalized triangle
- The Turán problem for projective geometries
- The maximum size of 3-uniform hypergraphs not containing a Fano plane
- Extremal problems in uniformly dense hypergraphs
- An intersection theorem for four sets
- A 2-stable family of triple systems
This page was built for publication: Triple Systems Not Containing a Fano Configuration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5696359)
