On the chromatic number of two generalized Kneser graphs

Published 12 May 2020 in math.CO | (2005.05762v1)

Abstract: We determine the chromatic number of some graphs of flags in buildings of type $A_4$, namely of the Kneser graphs of flags of type ${2,4}$ in the vector spaces $GF(q)^5$ for $q\geq3$, and of the Kneser graph of flags of type ${2,3}$ in the vector spaces $GF(q)^5$ for large $q$.

Abstract PDF Upgrade to Chat

Authors (3)

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Top Community Prompts

Explain it Like I'm 14

Practical Applications

Conceptual Simplification

Sign Up to Activate View All Prompts

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.