Note on set systems without a strong simplex
DOI10.1016/J.DISC.2010.02.003zbMATH Open1225.05235OpenAlexW2015695984MaRDI QIDQ968446FDOQ968446
Publication date: 5 May 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2010.02.003
Recommendations
[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Erd%EF%BF%BD%EF%BF%BDs-Ko-Rado+theorem&go=Go Erd��s-Ko-Rado theorem]\(d\)-simplex[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Chv%EF%BF%BD%EF%BF%BDtal%27s+simplex+conjecture&go=Go Chv��tal's simplex conjecture]strong \(d\)-simplex
Cites Work
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Exact solution of some Turán-type problems
- On generalized graphs
- Set systems without a simplex or a cluster
- Minimal paths and cycles in set systems
- Proof of a conjecture of Erdős on triangles in set-systems
- Set Systems without a Strong Simplex
- An Extremal Set-Intersection Theorem
- Simplex Stability
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: Note on set systems without a strong simplex
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968446)