Perfect 2-colorings of the Grassmann graph of planes

DOI10.37236/8672zbMath1431.05065OpenAlexW3001023799MaRDI QIDQ2290347

Klaus Metsch, Stefaan De Winter

Publication date: 27 January 2020

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

Full work available at URL: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v27i1p21

zbMATH Keywords

Grassmann graphintriguing sets

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Combinatorial aspects of finite geometries (05B25) Coloring of graphs and hypergraphs (05C15) Polar geometry, symplectic spaces, orthogonal spaces (51A50) Combinatorial aspects of algebraic geometry (05E14)

Related Items (3)

Completely regular codes in Johnson and Grassmann graphs with small covering radii ⋮ Degree 2 Boolean functions on Grassmann graphs ⋮ Perfect 2‐colorings of Hamming graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weighted intriguing sets of finite generalised quadrangles
• On the smallest non-trivial tight sets in Hermitian polar spaces
• Intriguing sets of vertices of regular graphs
• Tight sets in finite classical polar spaces
• Intriguing sets of quadrics in \(\mathrm{PG}(5, q)\)
• Tight sets and \(m\)-ovoids of generalised quadrangles
• Tight sets and \(m\)-ovoids of finite polar spaces

This page was built for publication: Perfect 2-colorings of the Grassmann graph of planes