New bounds for the acyclic chromatic index

DOI10.1016/j.disc.2016.05.002zbMath1339.05110arXiv1412.6237OpenAlexW1758674513MaRDI QIDQ294561

Anton Bernshteyn

Publication date: 16 June 2016

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

Full work available at URL: https://arxiv.org/abs/1412.6237

zbMATH Keywords

Lovász local lemmaacyclic edge coloringlocal cut lemma

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (4)

A new bound on the acyclic edge chromatic number ⋮ Generalized acyclic edge colorings via entropy compression ⋮ Acyclic edge colourings of graphs with large girth ⋮ The local cut lemma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved bounds on coloring of graphs
• The local cut lemma
• Acyclic edge-coloring using entropy compression
• Improved bounds on acyclic edge colouring
• Acyclic edge colorings of graphs
• An Improvement of the Lovász Local Lemma via Cluster Expansion
• A constructive proof of the general lovász local lemma
• Acyclic coloring of graphs
• Acyclic edge colourings of graphs with large girth
• On a problem of K. Zarankiewicz
• Acyclic colorings of planar graphs

This page was built for publication: New bounds for the acyclic chromatic index