New bounds for the acyclic chromatic index

@article{Bernshteyn2016NewBF,
  title={New bounds for the acyclic chromatic index},
  author={Anton Bernshteyn},
  journal={Discret. Math.},
  year={2016},
  volume={339},
  pages={2543-2552}
}
  • Anton Bernshteyn
  • Published 19 December 2014
  • Computer Science, Mathematics
  • Discret. Math.
An edge coloring of a graph G is called an acyclic edge coloring if it is proper and every cycle in G contains edges of at least three different colors. The least number of colors needed for an acyclic edge coloring of G is called the acyclic chromatic index of G and is denoted by a ' ( G ) . Fiamcik (1978) and independently Alon, Sudakov, and Zaks (2001) conjectured that a ' ( G ) ź Δ ( G ) + 2 , where Δ ( G ) denotes the maximum degree of G . The best known general bound is a ' ( G ) ź 4… Expand
Acyclic edge colourings of graphs with large girth
TLDR
An edge colouring of a graph G is called acyclic if it is proper and every cycle contains at least three colours and there exists a $g=g(\varepsilon)$ such that if G has girth at least $g$ then $G$ admits an acyClic edge colourings with at most $(1+\varpsilon)\Delta$ colours. Expand
Generalized acyclic edge colorings via entropy compression
TLDR
It is proved in this paper that for every graph G with girth at least two r-acyclic edge chromatic number at least 2r-1, A'_r( G) = 9r-7Δ+10r-12 holds and the approach is based on the entropy compression method. Expand
A new bound on the acyclic edge chromatic number
TLDR
A new bound is obtained for the acyclic edge chromatic number of a graph G with maximum degree Δ proving that a ′ ( G ) ≤ 3 . Expand
The Local Cut Lemma
TLDR
This paper provides a generalization of the LLL which implies a random cut in a directed graph with certain properties, and presents an improved lower bound on the number of edges in color-critical hypergraphs. Expand
A New Perspective on Stochastic Local Search and the Lovasz Local Lemma
We present a new perspective on the analysis of stochastic local search algorithms via linear algebra. Our key insight is that LLL-inspired convergence arguments can be seen as a method for boundingExpand
Backtracking and Commutative Algorithms for the LLL
TLDR
This work extends the framework of Achlioptas and Iliopoulos~\cite{AI} and provides a Local Lemma criterion that can capture every application of backtracking algorithms the authors are aware of and more and shows that for commutative algorithms, the witness tree lemma holds. Expand
Beyond the Lovász Local Lemma: Point to Set Correlations and Their Algorithmic Applications
TLDR
A new convergence condition is introduced that seamlessly handles resampling, backtracking, and hybrid algorithms, i.e., algorithms that perform both resamplings and backtracking steps, and allows for the analysis of hybrid algorithms which were outside the scope of previous techniques. Expand
Focused Stochastic Local Search and the Lovász Local Lemma
We develop tools for analyzing focused stochastic local search algorithms. These are algorithms which search a state space probabilistically by repeatedly selecting a constraint that is violated inExpand
Colorability in Line Graphs

References

SHOWING 1-10 OF 15 REFERENCES
Acyclic edge colorings of graphs
A proper coloring of the edges of a graph G is called acyclic if there is no 2-colored cycle in G. The acyclic edge chromatic number of G, denoted by a′(G), is the least number of colors in anExpand
Acyclic Coloring of Graphs
TLDR
It is shown that if G has maximum degree d, then A(G) = 0(d4/3) as d → ∞, which settles a problem of Erdos who conjectured, in 1976, that A( G) = o(d2) as d →∞. Expand
Acyclic edge-coloring using entropy compression
TLDR
It is proved that every graph with maximum degree Delta has an acyclic edge-coloring with at most 4 Delta - 4 colors, improving the previous bound of 9.62 (Delta - 1). Expand
Improved bounds on coloring of graphs
Given a graph G with maximum degree @D>=3, we prove that the acyclic edge chromatic number a^'(G) of G is such that a^'(G)@[email protected]?9.62(@D-1)@?. Moreover we prove that: a^'(G)@[emailExpand
Asymptotics of the list-chromatic index for multigraphs
  • J. Kahn
  • Computer Science
  • Random Struct. Algorithms
  • 2000
TLDR
The list-chromatic index, χ′ l (G) of a multigraph G, is the least t such that if S(A) is a set of size t for each A ∈ E := E(G), then there exists a proper coloring σ of G with σ(A), which is at least the fractional chromatic index. Expand
Acyclic colorings of planar graphs
A coloring of the vertices of a graph byk colors is called acyclic provided that no circuit is bichromatic. We prove that every planar graph has an acyclic coloring with nine colors, and conjectureExpand
Acyclic edge colourings of graphs with large girth
TLDR
An edge colouring of a graph G is called acyclic if it is proper and every cycle contains at least three colours and there exists a $g=g(\varepsilon)$ such that if G has girth at least $g$ then $G$ admits an acyClic edge colourings with at most $(1+\varpsilon)\Delta$ colours. Expand
The Local Cut Lemma
TLDR
This paper provides a generalization of the LLL which implies a random cut in a directed graph with certain properties, and presents an improved lower bound on the number of edges in color-critical hypergraphs. Expand
The Local Action Lemma
The Lov\'{a}sz Local Lemma is a very powerful tool in probabilistic combinatorics, that is often used to prove existence of combinatorial objects satisfying certain constraints. Moser and Tardos haveExpand
A constructive proof of the general lovász local lemma
TLDR
This article improves upon recent findings so as to provide a method for making almost all known applications of the general Local Lemma algorithmic. Expand
...
1
2
...