Abstract
Given an edge colouring of a graph with a set of m colours, we say that the graph is exactly m-coloured if each of the colours is used. The question of finding exactly m-coloured complete subgraphs was first considered by Erickson in 1994; in 1999, Stacey and Weidl partially settled a conjecture made by Erickson and raised some further questions. In this paper, we shall study, for a colouring of the edges of the complete graph on N with exactly k colours, how small the set of natural numbers m for which there exists an exactly m-coloured complete infinite subgraph can be. We prove that this set must have size at least 2k; this bound is tight for infinitely many values of k. We also obtain a version of this result for colourings that use infinitely many colours.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
