Probabilistic methods in coloring and decomposition problems

Numerous problems in graph theory and combinatorics can be formulated in terms of the existence of certain colorings of graphs or hypergraphs. Many of these problems can be solved or partially solved by applying probabilistic arguments. In this paper we discuss several examples that illustrate the methods used. This is mainly a survey paper, but it contains some new results as well.

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

[2]  Bernard Péroche,et al.  Linear arboricity of digraphs , 1987, Networks.

[3]  Moni Naor,et al.  Small-bias probability spaces: efficient constructions and applications , 1990, STOC '90.

[4]  Moni Naor,et al.  Small-Bias Probability Spaces: Efficient Constructions and Applications , 1993, SIAM J. Comput..

[5]  Noga Alon,et al.  Graphs and Combinatorics © Springer-Verlag 1988 Every 8-Uniform 8-Regular Hypergraph Is 2-Colorable , 2022 .

[6]  Yasukazu Aoki.  The star-arboricity of the complete regular multipartite graphs , 1990, Discret. Math..

[7]  Noga Alon,et al.  Single Round Simulation on Radio Networks , 1992, J. Algorithms.

[8]  A. Leaf.  GRAPH THEORY AND PROBABILITY , 1957 .

[9]  Vojtech Rödl,et al.  Near Perfect Coverings in Graphs and Hypergraphs , 1985, Eur. J. Comb..

[10]  József Beck,et al.  An Algorithmic Approach to the Lovász Local Lemma. I , 1991, Random Struct. Algorithms.

[11]  Richard M. Karp,et al.  A Survey of Parallel Algorithms for Shared-Memory Machines , 1988 .

[12]  P. Erdös.  Some remarks on the theory of graphs , 1947 .

[13]  Frank Harary,et al.  Covering and packing in graphs IV: Linear arboricity , 1981, Networks.

[14]  J. Beck,et al.  On 3-chromatic hypergraphs , 1978, Discret. Math..

[15]  Noga Alon,et al.  The star arboricity of graphs , 1988, Discret. Math..

[16]  Frank Plumpton Ramsey,et al.  On a Problem of Formal Logic , 1930 .

[17]  Jeff Kahn,et al.  Coloring Nearly-Disjoint Hypergraphs with n+o(n) Colors , 1992, J. Comb. Theory, Ser. A.

[18]  N. Alon.  The linear arboricity of graphs , 1988 .

[19]  Joel H. Spencer,et al.  Asymptotic behavior of the chromatic index for hypergraphs , 1989, J. Comb. Theory, Ser. A.

[20]  Noga Alon,et al.  On the complexity of radio communication , 1989, STOC '89.

[21]  P. Erdös,et al.  Graph Theory and Probability , 1959 .

[22]  Bruce A. Reed,et al.  Acyclic Coloring of Graphs , 1991, Random Struct. Algorithms.

[23]  Noga Alon,et al.  Simple construction of almost k-wise independent random variables , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[24]  Vojtech Rödl,et al.  On a Packing and Covering Problem , 1985, Eur. J. Comb..

[25]  J. Spencer.  Ten lectures on the probabilistic method , 1987 .

[26]  Noga Alon,et al.  A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.