Probabilistic methods in coloring and decomposition problems
From MaRDI portal
Publication:1322212
DOI10.1016/0012-365X(92)00465-4zbMath0804.05033MaRDI QIDQ1322212
Publication date: 5 May 1994
Published in: Discrete Mathematics (Search for Journal in Brave)
Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
A General Framework for Hypergraph Coloring, Fair splittings by independent sets in sparse graphs, Graphs with $\chi=\Delta$ Have Big Cliques, Graphs of low average degree without independent transversals, Almost Every Graph can be Covered by Linear Forests, On an \(f\)-coloring generalization of linear arboricity of multigraphs, Fair Representation by Independent Sets, Linear arboricity of regular digraphs, The linear arboricity of \(K_5\)-minor free graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Asymptotic behavior of the chromatic index for hypergraphs
- On a packing and covering problem
- Near perfect coverings in graphs and hypergraphs
- The linear arboricity of graphs
- On 3-chromatic hypergraphs
- Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors
- Star arboricity
- The star-arboricity of the complete regular multipartite graphs
- The star arboricity of graphs
- Asymptotically good list-colorings
- Every 8-uniform 8-regular hypergraph is 2-colorable
- Graph Theory and Probability
- A fast and simple randomized parallel algorithm for the maximal independent set problem
- Linear arboricity of digraphs
- Covering and packing in graphs IV: Linear arboricity
- Acyclic coloring of graphs
- An algorithmic approach to the Lovász local lemma. I
- The strong chromatic number of a graph
- Single round simulation on radio networks
- Some remarks on the theory of graphs
