Maximal sets of \(k\)-spaces pairwise intersecting in at least a \((k-2)\)-space

DOI10.37236/10027zbMath1486.05301arXiv2005.05494OpenAlexW3025394939MaRDI QIDQ2121804

Giovanni Longobardi, Jozefien D'haeseleer, Ago-Erik Riet, Storme, L.

Publication date: 4 April 2022

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Erdős-Ko-Rado theoremextremal set theory\(q\)-analogue of the Erdős-Ko-Rado problem

Mathematics Subject Classification ID

Extremal set theory (05D05) Combinatorial aspects of finite geometries (05B25) Combinatorial structures in finite projective spaces (51E20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations
• The Erdős-Ko-Rado theorem for vector spaces
• An extension of the Erdoes, Ko, Rado theorem to t-designs
• A new family of distance-regular graphs and the \(\{ 0,1,2 \}\)-cliques in dual polar graphs
• On sets of \(n\)-dimensional subspaces of projective spaces intersecting mutually in an \((n-2)\)-dimensional subspace
• Improvement to the sunflower bound for a class of equidistant constant dimension subspace codes
• 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 geometrical settings
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS

This page was built for publication: Maximal sets of \(k\)-spaces pairwise intersecting in at least a \((k-2)\)-space