On the number of star-shaped classes in optimal colorings of Kneser graphs

Research output: Journal PublicationArticlepeer-review

Abstract

A family of sets is called star-shaped if all the members of the family have a point in common. The main aim of this paper is to provide a negative answer to the following question raised by Aisenberg et al., for the case (Formula presented.). Do there exist (Formula presented.) -colorings of the (Formula presented.) -Kneser graphs with more than (Formula presented.) many non-star-shaped color classes?.

Original languageEnglish
Pages (from-to)230-238
Number of pages9
JournalJournal of Graph Theory
Volume105
Issue number2
DOIs
Publication statusPublished - Feb 2024

Keywords

  • Kneser graph
  • chromatic number
  • line graph

ASJC Scopus subject areas

  • Geometry and Topology
  • Discrete Mathematics and Combinatorics

Fingerprint

Dive into the research topics of 'On the number of star-shaped classes in optimal colorings of Kneser graphs'. Together they form a unique fingerprint.

Cite this