Edge colorings of complete graphs without tricolored triangles

By András Gyárfás, Gábor Simony. 2004

180 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/d1cbc2a0c86f92c3851f13276e2444f08a6bfe2b

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Colton Magnant
2. Shinya Fujita
3. Kenta Ozeki
4. András Gyárfás

In Discrete Mathematics and Combinatorics

1. Colton Magnant
2. Shinya Fujita
3. Kenta Ozeki
4. András Gyárfás

In Electrical and Electronic Engineering

1. Colton Magnant
2. Shinya Fujita
3. Kenta Ozeki
4. András Gyárfás

Citations in the corpus

• Large Monochromatic Components in Edge Colorings of Graphs: A Survey (2011, background): “Edge colorings of complete graphs in which no triangles are colored with three distinct colors are called Gallai-colorings in [ 31 ].”
• Rainbow Generalizations of Ramsey Theory - A Dynamic Survey (2014, methodology): “Theorem 83 ([39, 75, 87]) Any Gallai coloring can be obtained by substituting Gallai colored complete graphs into the vertices of a 2-colored complete graph.”