Balanced edge-colorings avoiding rainbow cliques of size four

被引:0
|
作者
Clemen, Felix Christian [1 ]
Wagner, Adam Zsolt [2 ]
机构
[1] Karlsruhe Inst Technol, D-76133 Karlsruhe, Germany
[2] Worcester Polytech Inst, Worcester, MA 01609 USA
来源
ELECTRONIC JOURNAL OF COMBINATORICS | 2023年 / 30卷 / 03期
关键词
SUBGRAPHS;
D O I
10.37236/11965
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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 = 13k vertices, for every positive integer k, with no rainbow K4. This solves a problem by Erdo ˝s and Tuza.
引用
收藏
页数:3
相关论文
共 50 条
  • [1] Edge-colorings avoiding rainbow stars
    Hoppen, Carlos
    Lefmann, Hanno
    Odermann, Knut
    Sanches, Juliana
    [J]. JOURNAL OF GRAPH THEORY, 2018, 87 (04) : 399 - 429
  • [2] Edge-colorings avoiding rainbow and monochromatic subgraphs
    Axenovich, Maria
    Iverson, Perry
    [J]. DISCRETE MATHEMATICS, 2008, 308 (20) : 4710 - 4723
  • [3] Avoiding rainbow induced subgraphs in edge-colorings
    Sackett, Chelsea
    Axenovich, Maria
    [J]. AUSTRALASIAN JOURNAL OF COMBINATORICS, 2009, 44 : 287 - 296
  • [4] On graphs with a large number of edge-colorings avoiding a rainbow triangle
    Hoppen, Carlos
    Lefmann, Hanno
    Odermann, Knut
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 2017, 66 : 168 - 190
  • [5] Edge-colorings avoiding patterns in a triangle
    Hoppen, Carlos
    Lefmann, Hanno
    Schmidt, Dionatan Ricardo
    [J]. DISCRETE MATHEMATICS, 2024, 347 (04)
  • [6] Uniform hypergraphs with many edge-colorings avoiding a fixed rainbow expanded complete graph
    Contiero, Lucas de Oliveira
    Hoppen, Carlos
    Lefmann, Hanno
    Odermann, Knut
    [J]. JOURNAL OF GRAPH THEORY, 2021, 98 (01) : 141 - 173
  • [7] Edge-colorings of uniform hypergraphs avoiding monochromatic matchings
    Hoppen, Carlos
    Kohayakawa, Yoshiharu
    Lefmann, Hanno
    [J]. DISCRETE MATHEMATICS, 2015, 338 (02) : 262 - 271
  • [8] Edge-colorings of Kn Which Forbid Rainbow Cycles
    Gouge, Adam
    Hoffman, Dean
    Johnson, Peter
    Nunley, Laura
    Paben, Luke
    [J]. UTILITAS MATHEMATICA, 2010, 83 : 219 - 232
  • [9] Graphs with many edge-colorings such that complete graphs are rainbow
    Bastos, Josefran de O.
    Hoppen, Carlos
    Lefmann, Hanno
    Oertel, Andy
    Schmidt, Dionatan R.
    [J]. DISCRETE APPLIED MATHEMATICS, 2023, 333 : 151 - 164
  • [10] Edge-colorings avoiding a fixed matching with a prescribed color pattern
    Hoppen, Carlos
    Lefmann, Hanno
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 2015, 47 : 75 - 94