Structure and stability of triangle-free set systems
From MaRDI portal
Recommendations
Cites work
- A hypergraph extension of the bipartite Turán problem
- A new generalization of Mantel's theorem to \(k\)-graphs
- An Extremal Set-Intersection Theorem
- Covering by intersecting families
- Exact computation of the hypergraph Turán function for expanded complete 2-graphs
- Exact solution of some Turán-type problems
- scientific article; zbMATH DE number 3557819 (Why is no real title available?)
- scientific article; zbMATH DE number 3453609 (Why is no real title available?)
- scientific article; zbMATH DE number 3262986 (Why is no real title available?)
- Hypergraphs in which all disjoint pairs have distinct unions
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- On a Conjecture of Chvátal on m -Intersecting Hypergraphs
- On a hypergraph Turán problem of Frankl
- On a problem of Chvatal and Erdoes on hypergraphs containing no generalized simplex
- On Sperner families satisfying an additional condition
- Proof of a conjecture of Erdős on triangles in set-systems
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- The number of graphs without forbidden subgraphs
- The Turán number of the Fano plane
- Triple Systems Not Containing a Fano Configuration
Cited in
(24)- The maximum size of hypergraphs without generalized 4-cycles
- Two-regular subgraphs of hypergraphs
- Combinatorial properties of systems of sets
- Triangle free sets and arithmetic progressions---two Pisier type problems
- Relative Turán numbers for hypergraph cycles
- A hypergraph Turán problem with no stability
- A unified approach to hypergraph stability
- The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
- Stability versions of Erdős-Ko-Rado type theorems via isoperimetry
- Proof of a conjecture of Erdős on triangles in set-systems
- An intersection theorem for four sets
- Triangle-intersecting families of graphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Simplex stability
- scientific article; zbMATH DE number 1753912 (Why is no real title available?)
- Stability of the potential function
- Exchange properties of finite set-systems
- A structural result for 3-graphs
- Set systems without a simplex or a cluster
- Tight bounds on the coefficients of partition functions via stability
- A 2-stable family of triple systems
- Set systems without a 3-simplex
- A hypergraph bipartite Turán problem with odd uniformity
- Hypergraphs with many extremal configurations
This page was built for publication: Structure and stability of triangle-free set systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3420310)
