2000 character limit reached
Critical subgraphs of Schrijver graphs for the fractional chromatic number
Published 19 Dec 2022 in math.CO | (2212.09520v1)
Abstract: Schrijver graphs are vertex-color-critical subgraphs of Kneser graphs having the same chromatic number. They also share the value of their fractional chromatic number but Schrijver graphs are not critical for that. Here we present an induced subgraph of every Schrijver graph that is vertex-critical with respect to the fractional chromatic number. These subgraphs turn out to be isomorphic with certain circular complete graphs. We also characterize the critical edges within this subgraph.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.