Rainbow Subgraphs in Edge-colored Complete Graphs -- Answering two Questions by Erdős and Tuza
Preprint
Abstract
An edge-coloring of a complete graph with a set of colors $C$ is called completely balanced if any vertex is incident to the same number of edges of each color from $C$. Erd\H{o}s and Tuza asked in $1993$ whether for any graph $F$ on $\ell$ edges and any completely balanced coloring of any sufficiently large complete graph using $\ell$ colors contains a rainbow copy of $F$. This question was restated by Erd\H{o}s in his list of ``Some of my favourite problems on cycles and colourings''. We answer this question in the negative for most cliques $F=K_q$ by giving explicit constructions of respective completely balanced colorings. Further, we answer a related question concerning completely balanced colorings of complete graphs with more colors than the number of edges in the graph $F$.
Keywords
All Related Versions
This publication has 13 references indexed in Scilit:
- An asymptotic version of the prime power conjecture for perfect difference setsMathematische Annalen, 2021
- Random subgraphs of properly edge-coloured complete graphs and long rainbow cyclesIsrael Journal of Mathematics, 2017
- Generalized Sidon setsAdvances in Mathematics, 2010
- Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraintsRandom Structures & Algorithms, 2003
- An Anti-Ramsey TheoremCombinatorica, 2002
- Rainbow subgraphs in properly edge‐colored graphsRandom Structures & Algorithms, 1992
- A note on planar difference setsJournal of Combinatorial Theory, Series A, 1985
- On the Geometry of Planar Difference SetsEuropean Journal of Combinatorics, 1984
- On restricted colourings ofK nCombinatorica, 1984
- Lower bounds for some Ramsey numbersDiscrete Mathematics, 1972