← All problems

Kaneko–Kano–Suzuki conjecture on rainbow spanning trees in proper colourings

9 years old · traced to

Let KnK_n be a complete graph with a proper edge-colouring, meaning that any two incident edges have different colours. A subgraph is rainbow if all its edges have distinct colours, and edge-disjoint subgraphs share no edges. Kaneko–Kano–Suzuki conjecture. For all n>4n>4, every properly edge-coloured KnK_n contains \floorn/2\floor{n/2} edge-disjoint rainbow spanning trees. This generalizes the Brualdi–Hollingsworth setting from 11-factorizations to arbitrary proper edge-colourings. The source describes linear-size and asymptotic progress, but does not state that the exact conjecture is proved in full.

References

2 papers in this index state this conjecture (2017–2019). The statement above is taken from the most recent of them; the others are arXiv:1703.07301.

Source: Stefan Glock, Daniela Kühn, Richard Montgomery and Deryk Osthus, “Decompositions into isomorphic rainbow spanning trees”, arXiv:1903.04262 (2020).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.