The chromatic number of the \(q\)-Kneser graph for large \(q\)

zbMath1409.51008arXiv1806.00279MaRDI QIDQ1733933

Ferdinand Ihringer

Publication date: 22 March 2019

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

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

Mathematics Subject Classification ID

Extremal set theory (05D05) Combinatorial aspects of finite geometries (05B25) Boolean functions (06E30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial structures in finite projective spaces (51E20)

Related Items (2)

Remarks on the Erdős matching conjecture for vector spaces ⋮ Cameron-Liebler \(k\)-sets in \(\text{AG}(n,q)\)

Cites Work

• Unnamed Item
• The eigenvalue method for cross \(t\)-intersecting families
• Cross-intersecting Erdős-Ko-Rado sets in finite classical polar spaces
• On the chromatic number of \(q\)-Kneser graphs
• Kneser's conjecture, chromatic number, and homotopy
• A Hilton-Milner theorem for vector spaces
• The Erdős-Ko-Rado theorem for vector spaces
• Intersection theorems for systems of finite vector spaces
• Subsets of association schemes corresponding to eigenvectors of the Bose-Mesner algebra
• Boolean degree 1 functions on some classical association schemes
• Cameron-Liebler $k$-classes in \(\mathrm{PG}(2k+1,q)\)
• The eigenspaces of the Bose-Mesner algebras of the association schemes corresponding to projective spaces and polar spaces
• Cameron-Liebler sets of \(k\)-spaces in \(\mathrm{PG}(n,q)\)
• A gap result for Cameron-Liebler \(k\)-classes
• Theorems of Erdős-Ko-Rado type in polar spaces
• A proof of the Cameron-Ku conjecture
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS

This page was built for publication: The chromatic number of the \(q\)-Kneser graph for large \(q\)