Author:
Hoppen Carlos,Lefmann Hanno,Odermann Knut,Sanches Juliana
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference9 articles.
1. The number of edge colorings with no monochromatic cliques;Alon;J. London Math. Soc.,2004
2. A remark on the number of edge colorings of graphs;Balogh;European Journal of Combinatorics,2006
3. The asymptotic number of labeled graphs with given degree sequences;Bender;J. Combinatorial Theory Ser. A,1978
4. Edge-colorings of graphs avoiding a prescribed coloring pattern;Benevides;Sum(m)it,2014
5. Some new applications of probability methods to combinatorial analysis and graph theory;Erdős,1974
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Stability for the Erdős-Rothschild problem;Forum of Mathematics, Sigma;2023
2. The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques;Mathematical Proceedings of the Cambridge Philosophical Society;2017-01-23
3. A rainbow Erdős-Rothschild problem;Electronic Notes in Discrete Mathematics;2015-11