Acyclic systems of representatives and acyclic colorings of digraphs

A natural digraph analog of the graph theoretic concept of “an independent set” is that of “an acyclic set of vertices,” namely a set not spanning a directed cycle. By this token, an analog of the notion of coloring of a graph is that of decomposition of a digraph into acyclic sets. We extend some known results on independent sets and colorings in graphs to acyclic sets and acyclic colorings of digraphs. In particular, we prove bounds on the topological connectivity of the complex of acyclic sets, and using them we prove sufficient conditions for the existence of acyclic systems of representatives of a system of sets of vertices. These bounds generalize a result of Tardos and Szabo. We prove a fractional version of a strong-acyclic-coloring conjecture for digraphs. © 2008 Wiley Periodicals, Inc. J Graph Theory 59: 177–189, 2008

[1]  Penny E. Haxell,et al.  A condition for matchability in hypergraphs , 1995, Graphs Comb..

[2]  Gábor Tardos,et al.  Bounded size components--partitions and transversals , 2003, J. Comb. Theory, Ser. B.

[3]  Raphael Yuster,et al.  Independent transversals in r-partite graphs , 1997, Discret. Math..

[4]  E. Berger,et al.  Eigenvalues and homology of flag complexes and vector representations of graphs , 2003 .

[5]  Ron Aharoni,et al.  Independent systems of representatives in weighted graphs , 2007, Comb..

[6]  J. Spencer.  Probabilistic Methods in Combinatorics , 1974 .

[7]  Bojan Mohar,et al.  The circular chromatic number of a digraph , 2004 .

[8]  Ron Aharoni,et al.  The intersection of a matroid and a simplicial complex , 2006 .

[9]  Roy Meshulam,et al.  The Clique Complex and Hypergraph Matching , 2001, Comb..

[10]  Penny E. Haxell.  On the Strong Chromatic Number , 2004, Comb. Probab. Comput..

[11]  Roy Meshulam,et al.  Domination numbers and homology , 2003, J. Comb. Theory A.

[12]  Penny Haxell,et al.  A Note on Vertex List Colouring , 2001, Combinatorics, Probability and Computing.

[13]  Guoping Jin,et al.  Complete Subgraphs of r-partite Graphs , 1992, Combinatorics, probability & computing.

[14]  Gábor Tardos,et al.  Extremal Problems For Transversals In Graphs With Bounded Degree , 2006, Comb..

[15]  Ron Aharoni,et al.  Hall's theorem for hypergraphs , 2000 .

[16]  Aharoni,et al.  Triangulated Spheres and Colored Cliques , 2002 .

[17]  Gregory Gutin,et al.  Digraphs - theory, algorithms and applications , 2002 .

[18]  Ron Aharoni,et al.  A Tree Version of Kőnig's Theorem , 2002, Comb..

[19]  Bojan Mohar,et al.  The circular chromatic number of a digraph , 2004, J. Graph Theory.