A note on balanced edge-colorings avoiding rainbow cliques of size four
Combinatorics
2023-03-29 v1
Abstract
A balanced edge-coloring of the complete graph is an edge-coloring such that every vertex is incident to each color the same number of times. In this short note, we present a construction of a balanced edge-coloring with six colors of the complete graph on vertices, for every positive integer , with no rainbow . This solves a problem by Erd\H{o}s and Tuza.
Cite
@article{arxiv.2303.15476,
title = {A note on balanced edge-colorings avoiding rainbow cliques of size four},
author = {Felix Christian Clemen and Adam Zsolt Wagner},
journal= {arXiv preprint arXiv:2303.15476},
year = {2023}
}
Comments
2 pages