Abstract
Consider the set of all proper edge-colourings of a graph G with n colours. Among all such colourings, the minimum length of a longest two-coloured cycle is denoted L(n, G). The problem of understanding L(n, G) was posed by Häggkvist in 1978 and, specifically, L(n, K n,n ) has received recent attention. Here we construct, for each prime power q ≥ 8, an edge-colouring of K n,n with n colours having all two-coloured cycles of length ≤ 2q 2, for integers n in a set of density 1 − 3/(q − 1). One consequence is that L(n, K n,n ) is bounded above by a polylogarithmic function of n, whereas the best known general upper bound was previously 2n − 4.
Similar content being viewed by others
References
P. J. Cameron: Minimal edge-colourings of complete graphs. J. London Math. Soc. 11 (1975), 337–346.
R. Häggkvist: Problems, in: Proc. of the 5th Hungarian colloquium on combinatorics, Keszthely, Bolyai János Math. Soc., Budapest (1978), 1203–1204.
A. E. Ingham: The Distribution of Prime Numbers, Cambridge University Press, Cambridge, 1995.
J. Ninčák and P. J. Ownes: On a problem of R. Häggkvist concerning edge-colouring of bipartite graphs, Combinatorica 24(2) (2004), 325–329.
Author information
Authors and Affiliations
Corresponding author
Additional information
Research of the first author is supported by NSERC.
Rights and permissions
About this article
Cite this article
Dukes, P., Ling, A.C.H. Note edge-colourings of K n,n with no long two-coloured cycles. Combinatorica 28, 373–378 (2008). https://doi.org/10.1007/s00493-008-2272-6
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00493-008-2272-6