2000 character limit reached
On the number of heterochromatic trees in nice and beautiful colourings of complete graphs (2106.02905v2)
Published 5 Jun 2021 in math.CO
Abstract: We introduce classes of edge-colourings of the complete graph -- that we call nice and beautiful -- and study how many heterochromatic spanning trees appear under such colourings. We prove that if the colouring is nice, there is at least a quadratic number of different heterochromatic trees; and if the colouring is beautiful there is an exponential number of different such trees.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.