The largest Erdős-Ko-Rado sets in \(2-(v,k,1)\) designs

DOI10.1007/s10623-014-9929-5zbMath1312.05022arXiv1601.00441OpenAlexW2197421906MaRDI QIDQ2345921

Maarten De Boeck

Publication date: 21 May 2015

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1601.00441

zbMATH Keywords

Steiner systemunitalblock designErdős-Ko-Rado set

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Steiner systems in finite geometry (51E10) Erd?s problems and related topics of discrete geometry (52C10) Triple systems (05B07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On \(q\)-analogues and stability theorems
• On the chromatic number of \(q\)-Kneser graphs
• The exact bound in the Erdős-Ko-Rado theorem
• A Hilton-Milner theorem for vector spaces
• An extension of the Erdoes, Ko, Rado theorem to t-designs
• On the maximum size of Erdős-Ko-Rado sets in \(H(2d+1, q^2)\)
• The largest Erdős-Ko-Rado sets of planes in finite projective and finite classical polar spaces
• Theorems of Erdős-Ko-Rado type in polar spaces
• Theorems of Erdős-Ko-Rado type in geometrical settings
• Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs
• Automorphisms of unitary block designs
• Some unitals on 28 points and their embeddings in projective planes of order 9
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS

This page was built for publication: The largest Erdős-Ko-Rado sets in \(2-(v,k,1)\) designs