Add to ORKGGiven d ¿¿ (0,¿¿) let kd be the smallest integer k such that d < 2k log k. We prove that the chromatic number of a random graph G(n, d/n) is either kd or kd + 1 almost surely
Given a graph G and an integer k, two players take turns coloring the vertices of G one by one using...
We consider the problem of k-colouring a random r-uniform hypergraph with n vertices and cn edges, w...
We consider the problem of k-colouring a random r-uniform hypergraph with n vertices and cn edges, w...
Given d ∈ (0, ∞) let kd be the smallest integer k such that d<2k log k. We prove that the chromat...
Given d let k d be the smallest integer k such that d < 2k log k. We prove that the chromatic...
AbstractIn this work we show that, for any fixed d, random d-regular graphs asymptotically almost su...
We consider random graphs G,,., , with f ixed edge-probabil i ty p. We ref ine an argument of Bol l...
In this paper we consider the classical Erdos-Renyi model of random graphs G"n","p. We show that for...
Let f k (n; p) denote the probability that the random graph G(n; p) is k-colorable. We show that for...
AbstractWhen we wish to compute lower bounds for the chromatic number χ(G) of a graph G, it is of in...
Given a graph G and an integer k, two players take turns coloring the vertices of G one by one using...
<p>A proper 2-tone <em>k</em>-coloring of a graph is a labeling of the vertices with elements from (...
<p>Given a graph G and an integer k, two players take turns coloring the vertices of G one by one us...
Let G be an abelian group of cardinality N, where hcf(N,6) = 1, and let A be a random subset of G. F...
A proper 2-tone k-coloring of a graph is a labeling of the vertices with elements from ([k]2) such t...
Given a graph G and an integer k, two players take turns coloring the vertices of G one by one using...
We consider the problem of k-colouring a random r-uniform hypergraph with n vertices and cn edges, w...
We consider the problem of k-colouring a random r-uniform hypergraph with n vertices and cn edges, w...
Given d ∈ (0, ∞) let kd be the smallest integer k such that d<2k log k. We prove that the chromat...
Given d let k d be the smallest integer k such that d < 2k log k. We prove that the chromatic...
AbstractIn this work we show that, for any fixed d, random d-regular graphs asymptotically almost su...
We consider random graphs G,,., , with f ixed edge-probabil i ty p. We ref ine an argument of Bol l...
In this paper we consider the classical Erdos-Renyi model of random graphs G"n","p. We show that for...
Let f k (n; p) denote the probability that the random graph G(n; p) is k-colorable. We show that for...
AbstractWhen we wish to compute lower bounds for the chromatic number χ(G) of a graph G, it is of in...
Given a graph G and an integer k, two players take turns coloring the vertices of G one by one using...
<p>A proper 2-tone <em>k</em>-coloring of a graph is a labeling of the vertices with elements from (...
<p>Given a graph G and an integer k, two players take turns coloring the vertices of G one by one us...
Let G be an abelian group of cardinality N, where hcf(N,6) = 1, and let A be a random subset of G. F...
A proper 2-tone k-coloring of a graph is a labeling of the vertices with elements from ([k]2) such t...
Given a graph G and an integer k, two players take turns coloring the vertices of G one by one using...
We consider the problem of k-colouring a random r-uniform hypergraph with n vertices and cn edges, w...
We consider the problem of k-colouring a random r-uniform hypergraph with n vertices and cn edges, w...