Erdős--Ko--Rado for three sets
From MaRDI portal
Publication:2368657
DOI10.1016/J.JCTA.2005.04.001zbMATH Open1088.05041OpenAlexW2139049657MaRDI QIDQ2368657FDOQ2368657
Authors: Dhruv Mubayi
Publication date: 28 April 2006
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2005.04.001
Recommendations
Cites Work
Cited In (19)
- On set systems without a simplex-cluster and the junta method
- Non-trivial 3-wise intersecting uniform families
- Unavoidable subhypergraphs: \(\mathbf a\)-clusters
- New results on simplex-clusters in set systems
- On Multicolor Ramsey Numbers of Triple System Paths of Length 3
- Simplex stability
- On the \(d\)-cluster generalization of Erdős-Ko-Rado
- Uniform hypergraphs under certain intersection constraints between hyperedges
- On Mubayi's conjecture and conditionally intersecting sets
- Set systems without a simplex or a cluster
- Unavoidable stars in 3-graphs
- Structural results for conditionally intersecting families and some applications
- \(d\)-cluster-free sets with a given matching number
- Invitation to intersection problems for finite sets
- A structural result for 3-graphs
- Unavoidable subhypergraphs: \(\mathbf a\)-clusters
- Set systems with union and intersection constraints
- An intersection theorem for four sets
- Title not available (Why is that?)
This page was built for publication: Erdős--Ko--Rado for three sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2368657)