Balanced Edge-Colorings Avoiding Rainbow Cliques of Size Four
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 $n=13^k$ vertices, for every positive integer $k$, with no rainbow $K_4$. This solves a problem by Erdős and Tuza.
| Zugehörige Institution(en) am KIT | Institut für Algebra und Geometrie (IAG) |
| Publikationstyp | Zeitschriftenaufsatz |
| Publikationsjahr | 2023 |
| Sprache | Englisch |
| Identifikator | ISSN: 1077-8926, 1097-1440, 2150-959X, 2156-3527 KITopen-ID: 1000162233 |
| Erschienen in | The Electronic Journal of Combinatorics |
| Verlag | Electronic Journal of Combinatorics |
| Band | 30 |
| Heft | 3 |
| Seiten | Art.-Nr.: P3.17 |
| Vorab online veröffentlicht am | 11.08.2023 |
| Nachgewiesen in | Web of Science Scopus Dimensions |