Ramsey properties of random graphs
Journal of Combinatorial Theory Series B
Globally sparse vertex-Ramsey graphs
Journal of Graph Theory
Zero knowledge and the chromatic number
Journal of Computer and System Sciences - Eleventh annual conference on structure and complexity 1996
A sharp threshold for k-colorability
Random Structures & Algorithms
Sharp thresholds for certain Ramsey properties of random graphs
Random Structures & Algorithms
Random Structures & Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Ramsey Games Against a One-Armed Bandit
Combinatorics, Probability and Computing
Random Structures & Algorithms - Proceedings of the Eleventh International Conference "Random Structures and Algorithms," August 9—13, 2003, Poznan, Poland
Online vertex colorings of random graphs without monochromatic subgraphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On the chromatic number of random graphs
Journal of Combinatorial Theory Series B
Algorithmic Barriers from Phase Transitions
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Upper bounds for online ramsey games in random graphs
Combinatorics, Probability and Computing
Online ramsey games in random graphs
Combinatorics, Probability and Computing
Online vertex-coloring games in random graphs
Combinatorica
SIAM Journal on Discrete Mathematics
Small subgraphs in random graphs and the power of multiple choices
Journal of Combinatorial Theory Series B
Hi-index | 0.00 |
Consider the following generalized notion of graph coloring: a coloring of the vertices of a graph G is valid w.r.t. some given graph F if there is no copy of F in G whose vertices all receive the same color. We study the problem of computing valid colorings of the binomial random graph Gn,p on n vertices with edge probability p = p(n) in the following online setting: the vertices of an initially hidden instance of Gn,p are revealed one by one (together with all edges leading to previously revealed vertices) and have to be colored immediately and irrevocably with one of r available colors. It is known that for any fixed graph F and any fixed integer r ≥ 2 this problem has a threshold po (F, r, n) in the following sense: For any function p(n) = o(po) there is a strategy that a.a.s. (asymptotically almost surely, i.e., with probability tending to 1 as n tends to infinity) finds an r-coloring of Gn,p that is valid w.r.t. F online, and for any function p(n) = ω(po) any online strategy will a.a.s. fail to do so. In this work we establish a general correspondence between this probabilistic problem and a deterministic two-player game in which the random process is replaced by an adversary that is subject to certain restrictions inherited from the random setting. This characterization allows us to compute, for any F and r, a value γ = γ(F, r) such that the threshold of the probabilistic problem is given by po(F, r, n) = n−γ. Our approach yields polynomial-time coloring algorithms that a.a.s. find valid colorings of Gn,p online in the entire regime below the respective thresholds, i.e., for any p(n) = o(n-γ).