On the pseudoachromatic index of the complete graph III

Abstract

Let q be the projective plane of order q , let (m):=(L(Km)) the pseudoachromatic number of the complete line graph of order m , let a∈ \ 3,4,…,q2+1 \ and ma=(q+1)2-a . In this paper, we improve the upper bound of (m) 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 x≥ 2 is an integer and m∈ \4x2-x,…,4x2+3x-3\ then (m) ≤ 2x(m-x-1). On the other hand, if q is even and there exists q we give a complete edge-colouring of Kma with (ma-a)q colours. Moreover, using this colouring we extend the previous results for a=\-1,0,1,2\ 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 (ma)=(ma-a)q for a∈ \3,4,…, 1+4q+92 -1 \ .

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…