Perfect 2-colorings of the Grassmann graph of planes (Q2290347)

From MaRDI portal





scientific article; zbMATH DE number 7158244
Language Label Description Also known as
default for all languages
No label defined
    English
    Perfect 2-colorings of the Grassmann graph of planes
    scientific article; zbMATH DE number 7158244

      Statements

      Perfect 2-colorings of the Grassmann graph of planes (English)
      0 references
      0 references
      0 references
      27 January 2020
      0 references
      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\).
      0 references
      intriguing sets
      0 references
      Grassmann graph
      0 references

      Identifiers