On graphs with a large number of edge-colorings avoiding a rainbow triangle
Authors:
- Carlos HoppenCHCarlos Hoppen
- Hanno LefmannHLHanno Lefmann
- Knut OdermannKOKnut Odermann
- 1 December 2017
- journal article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 66, 168-190
Abstract
No abstract availableFunding Information
- CAPES (408/13)
- DAAD (56267227, 57141126)
- FAPERGS (2233-2551/14-9)
- CNPq (448754/2014-2, 304510/2012-2)
This publication has 11 references indexed in Scilit:
- Edge-colorings of graphs avoiding complete graphs with a prescribed coloringDiscrete Mathematics, 2017
- The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliquesMathematical Proceedings of the Cambridge Philosophical Society, 2017
- A rainbow Erdős-Rothschild problemElectronic Notes in Discrete Mathematics, 2015
- A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularityJournal of Combinatorial Theory, Series B, 2015
- Edge-colorings avoiding a fixed matching with a prescribed color patternEuropean Journal of Combinatorics, 2015
- Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán numberEuropean Journal of Combinatorics, 2014
- The maximum number of K 3 -free and K 4 -free edge 4-coloringsJournal of the London Mathematical Society, 2012
- Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given SizeCombinatorics, Probability and Computing, 2012
- A remark on the number of edge colorings of graphsEuropean Journal of Combinatorics, 2006
- THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUESJournal of the London Mathematical Society, 2004