On the pseudoachromatic index of the complete graph III
G. Araujo-Pardo, J.J. Montellano-Ballesteros, C. Rubio-Montiel, R., Strausz

TL;DR
This paper improves bounds on the pseudoachromatic number of complete line graphs, providing new upper bounds and explicit colorings for certain graph orders, especially when the order relates to projective planes of even order.
Contribution
It introduces improved upper bounds for the pseudoachromatic number and constructs explicit edge-colorings for complete graphs based on projective plane properties.
Findings
Enhanced upper bounds for specific graph orders.
Explicit edge-colorings achieving these bounds.
Extension of previous results for certain parameter ranges.
Abstract
Let be the projective plane of order , let the pseudoachromatic number of the complete line graph of order , let and . In this paper, we improve the upper bound of given by Araujo-Pardo et al. [J Graph Theory 66 (2011), 89--97] and Jamison [Discrete Math. 74 (1989), 99--115] in the following values: if is an integer and then . On the other hand, if is even and there exists we give a complete edge-colouring of with colours. Moreover, using this colouring we extend the previous results for given by Araujo-Pardo et al. in [J Graph Theory 66 (2011), 89--97] and [Bol. Soc. Mat. Mex. (2014) 20:17--28] proving that for $ a\in…
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.
