Bounds on Edge Colorings with Restrictions on the Union of Color Classes

DOI10.1137/080733917zbMath1223.05061MaRDI QIDQ3008011

N. R. Aravind, C. R. Subramanian

Publication date: 17 June 2011

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/03e9fdda3664510e3593fa483f4700fe72b53ffa

zbMATH Keywords

treewidth; maximum degree; edge colorings; probabilistic arguments; acyclic edge colorings

Mathematics Subject Classification ID

05C15: Coloring of graphs and hypergraphs

05D40: Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.)