Pages that link to "Item:Q1108273"
From MaRDI portal
The following pages link to Symmetric designs as the solution of an extremal problem in combinatorial set theory (Q1108273):
Displaying 4 items.
- Intersecting designs from linear programming and graphs of diameter two (Q1322228) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- An Erdős-Ko-Rado theorem for regular intersecting families of octads (Q1821104) (← links)
- Ryser's conjecture for \(t\)-intersecting hypergraphs (Q2221906) (← links)