Graphs whose Kronecker covers are bipartite Kneser graphs
Takahiro Matsushita

TL;DR
This paper identifies specific simple graphs whose Kronecker covers are bipartite Kneser graphs, and determines their chromatic numbers and automorphism groups, advancing understanding of graph coverings and symmetries.
Contribution
It constructs graphs with Kronecker covers isomorphic to bipartite Kneser graphs and computes their chromatic numbers and automorphism groups, revealing new structural insights.
Findings
Existence of k simple graphs with Kronecker cover isomorphic to bipartite Kneser graph
Chromatic numbers of these graphs match n - 2k + 2
Automorphism groups of these graphs are determined
Abstract
We show that there are simple graphs whose Kronecker covers are isomorphic to the bipartite Kneser graph , and that their chromatic numbers coincide with . We also determine the automorphism groups of these graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Graph theory and applications · Finite Group Theory Research
