Set systems without a simplex or a cluster
From MaRDI portal
Recommendations
Cites work
- 4-books of three pages
- A homological approach to two problems on finite sets
- A new generalization of Mantel's theorem to \(k\)-graphs
- A new generalization of the Erdős-Ko-Rado theorem
- A Remark on Stirling's Formula
- An Elementary View of Euler's Summation Formula
- An exact Turán result for the generalized triangle
- An Extremal Set-Intersection Theorem
- An intersection theorem for four sets
- Erdős--Ko--Rado for three sets
- Erdős-Ko-Rado theorem with conditions on the maximal degree
- Exact solution of some Turán-type problems
- Intersecting Families are Essentially Contained in Juntas
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Minimal paths and cycles in set systems
- 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
- On the hardness of approximating minimum vertex cover
- On the measure of intersecting families, uniqueness and stability
- On Triple Systems with Independent Neighbourhoods
- Pairwise intersections and forbidden configurations
- Proof of a conjecture of Erdős on triangles in set-systems
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Stability theorems for cancellative hypergraphs
- Structure and stability of triangle-free set systems
- The complete intersection theorem 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
(31)- Set systems with union and intersection constraints
- A homological approach to two problems on finite sets
- The junta method in extremal hypergraph theory and Chvátal's conjecture
- On set systems without a simplex-cluster and the junta method
- On the \(d\)-cluster generalization of Erdős-Ko-Rado
- New results on simplex-clusters in set systems
- The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
- Stability versions of Erdős-Ko-Rado type theorems via isoperimetry
- Regular intersecting families
- Removal and stability for Erdős-Ko-Rado
- The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton-Milner family
- Unavoidable subhypergraphs: a-clusters
- Set systems without a strong simplex
- A simple removal lemma for large nearly-intersecting families
- Transference for the Erdős-Ko-Rado theorem
- Simplex stability
- Families of sets with intersecting clusters
- A hypergraph regularity method for generalized Turán problems
- On Mubayi's conjecture and conditionally intersecting sets
- An unstable hypergraph problem with a unique optimal solution
- Vertex isoperimetry and independent set stability for tensor powers of cliques
- Exchange properties of finite set-systems
- Hypergraphs without non-trivial intersecting subgraphs
- Triangles in intersecting families
- Unavoidable subhypergraphs: \(\mathbf a\)-clusters
- Set systems without a 3-simplex
- 3-cluster-free families of subspaces
- Some exact and asymptotic results for hypergraph Turán problems in _2-norm
- On the stability of the Erdős-Ko-Rado theorem
- Shadows and intersections: Stability and new proofs
- Note on set systems without a strong simplex
This page was built for publication: Set systems without a simplex or a cluster
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q532128)
