An extremal set theoretical characterization of some Steiner systems

DOI10.1007/BF02579293zbMath0535.05016OpenAlexW1969308840MaRDI QIDQ790818

Peter Frankl

Publication date: 1983

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579293

zbMATH Keywords

Steiner systemsubset

Mathematics Subject Classification ID

Hypergraphs (05C65) Permutations, words, matrices (05A05) Other designs, configurations (05B30)

Cites Work

• Extremal problems and coverings of the space
• Intersection theorems with geometric consequences
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On families of finite sets no two of which intersect in a singleton

Related Items (7)

The maximum number of edges in a 3-graph not containing a given star ⋮ Erdős-Ko-Rado theorems in certain semilattices ⋮ Short proofs of three results about intersecting systems ⋮ The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture ⋮ Variations on the Bollobás set-pair theorem ⋮ Forbidding just one intersection ⋮ The spectrum of minimal defining sets of some Steiner systems

This page was built for publication: An extremal set theoretical characterization of some Steiner systems