Perfect 2-colorings of the Grassmann graph of planes

DOI10.37236/8672MaRDI QIDQ2290347zbMATH OpenOpenAlexFDO

Authors Klaus Metsch, Stefaan De Winter

Publication date 27 January 2020

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

Copyright license Creative Commons Attribution 4.0 International

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

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Grassmann graphintriguing sets

Mathematics Subject Classification ID

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

Review text

Summary: We construct an infinite family of intriguing sets, or equivalently perfect 2-colorings, that are not tight in the Grassmann graph of planes of \(\mathrm{PG}(n,q)\), \(n\ge 5\) odd, and show that the members of the family are the smallest possible examples if \(n\ge 9\) or \(q\ge 25\).

Recommendations

• Codes and anticodes in the Grassman graph
• Induced perfect colorings
• On nonexistence of some perfect 2-colorings of Johnson graphs
• On perfect 2-colorings of Johnson graphs \(J(v, 3)\)
• scientific article; zbMATH DE number 5379405

Cites work

• scientific article; zbMATH DE number 3964850 (Why is no real title available?)
• scientific article; zbMATH DE number 17096 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• Intriguing sets of quadrics in \(\mathrm{PG}(5, q)\)
• Intriguing sets of vertices of regular graphs
• On the smallest non-trivial tight sets in Hermitian polar spaces
• Tight sets and \(m\)-ovoids of finite polar spaces
• Tight sets and \(m\)-ovoids of generalised quadrangles
• Tight sets in finite classical polar spaces
• Weighted intriguing sets of finite generalised quadrangles

Cited in

(7)

• Completely regular codes in Johnson and Grassmann graphs with small covering radii
• Degree 2 Boolean functions on Grassmann graphs
• Perfect 2-colorings of the generalized Petersen graph
• A Frameless 2-Coloring of the Plane Lattice
• Perfect 2‐colorings of Hamming graphs
• On two non-existence results for Cameron-Liebler \(k\)-sets in \(\mathrm{PG}(n,q)\)
• Regular sets of lines in rank 3 polar spaces

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2290347)