How many colours to connect cliques?
A. Manas
Abstract
We study the following problem: given an edge-colouring of a Kn with r colours, how many colours does one need to keep (in the worst-case scenario) so that the subgraph formed by those colours is connected? We determine this extremal function up to constant factors in every parameter regime, and show that it has the same asymptotic order as the corresponding number (of colours) needed for ensuring that no vertex is isolated. This gives a complete description of the ``spanning'' threshold for connectivity in edge-coloured complete graphs.
Create a lesson
Related papers
Simple Cayley permutations
Giulio Cerbai, Anders Claesson
Transfer of difference structures: a new semidirect product framework
Sophie Huczynska, Struan McCartney, Carys Williams
Connected Mutual-Visibility in Graphs
Tonny K B, Shikhi M
Decomposing Gorenstein polytopes of large index
Johannes Knupfer, Benjamin Nill
A non-trivial bound for 3AP-intersecting families
Peter Keevash
Solution to a conjecture on integral uniform hypercycles
Joyentanuj Das, Iswar Mahato