On set systems without singleton intersections
From MaRDI portal
Cites work
- A counterexample to Borsuk’s conjecture
- Algebraic combinatorics. Translated from the Japanese
- Borsuk's problem and the chromatic numbers of some metric spaces
- Erdős-Ko-Rado theorems. Algebraic approaches
- Forbidding just one intersection
- Hoffman's ratio bound
- Improved bounds for the sunflower lemma
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersection theorems with geometric consequences
- On a Conjecture of Chvátal on m -Intersecting Hypergraphs
- On families of finite sets no two of which intersect in a singleton
- On the Shannon capacity of a graph
- Set Systems with No Singleton Intersection
- Spread approximations for forbidden intersections problems
- Stability for the Complete Intersection Theorem, and the Forbidden Intersection Problem of Erd\H{o}s and S\'os
- Synchronization and separation in the Johnson schemes
- The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
- The Nonexistence of Certain Finite Projective Planes
- The Search for a Finite Projective Plane of Order 10
Cited in
(3)
This page was built for publication: On set systems without singleton intersections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7008000)