Edge-colorings avoiding patterns in a triangle
- 24 January 2024
- journal article
- research article
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (4)
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Conselho Nacional de Desenvolvimento Científico e Tecnológico (315132/2021-3)
- Deutscher Akademischer Austauschdienst
- Coordenação de Aperfeiçoamento de Pessoal de Nível Superior
This publication has 13 references indexed in Scilit:
- Remarks on an Edge-coloring ProblemElectronic Notes in Theoretical Computer Science, 2019
- Improved Bound on the Maximum Number of Clique-Free Colorings with Two and Three ColorsSIAM Journal on Discrete Mathematics, 2018
- On graphs with a large number of edge-colorings avoiding a rainbow triangleEuropean Journal of Combinatorics, 2017
- Edge-colorings of graphs avoiding complete graphs with a prescribed coloringDiscrete Mathematics, 2017
- A Rainbow Erdös--Rothschild ProblemSIAM Journal on Discrete Mathematics, 2017
- A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularityJournal of Combinatorial Theory, Series B, 2015
- The maximum number of K 3 -free and K 4 -free edge 4-coloringsJournal of the London Mathematical Society, 2012
- The Number Of Orientations Having No Fixed TournamentCombinatorica, 2006
- THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUESJournal of the London Mathematical Society, 2004
- The number of edge colorings with no monochromatic triangleJournal of Graph Theory, 1996