The chromatic index of finite projective spaces
Lei Xu, Tao Feng

TL;DR
This paper determines the chromatic index of finite projective spaces PG(n,q) for certain parameters, linking it to the existence of specific geometric configurations and establishing new parallelisms.
Contribution
It translates the problem of finding the chromatic index into geometric existence problems and proves the index for odd n and specific q values, confirming new parallelisms.
Findings
For odd n and q in {3,4,8,16}, the chromatic index is (q^n-1)/(q-1).
Establishes the existence of parallelisms in PG(n,q) for these parameters.
Links coloring problems to geometric configurations in finite projective spaces.
Abstract
A line coloring of PG, the -dimensional projective space over GF, is an assignment of colors to all lines of PG so that any two lines with the same color do not intersect. The chromatic index of PG, denoted by , is the least number of colors for which a coloring of PG exists. This paper translates the problem of determining the chromatic index of PG to the problem of examining the existences of PG and PG with certain properties. In particular, it is shown that for any odd integer and , , which implies the existence of a parallelism of PG for any odd integer and .
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 CDMA systems
