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 9 items.
- New proof of a theorem of Szekeres (Q1063031) (← links)
- A characterization of the extensions of symmetric designs (Q1068831) (← links)
- Bruck-Ryser abstract theorem and symmetric designs (Q1113911) (← links)
- 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)
- On a property of symmetric designs of order n\(\equiv 2(mod\,4)\) (Q1823947) (← links)
- Ryser's conjecture for \(t\)-intersecting hypergraphs (Q2221906) (← links)
- On some combinatorial problems (Q3231171) (← links)
