We consider the problem of k-colouring a random r-uniform hypergraph with n vertices and cn edges, where k, r, c remain constant as n→∞. Achlioptas and Naor showed that the chromatic number of a random graph in this setting, the case r=2, must have one of two easily computable values as n→∞. We give a complete generalisation of this result to random uniform hypergraphs
The choice number of a hypergraph H = (V, E) is the least integer s for which for every family of co...
Given d let k d be the smallest integer k such that d < 2k log k. We prove that the chromatic...
We study problems related to the chromatic number of a random intersection graph G (n,m, p). We intr...
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...
We consider the problem of k-colouring a random r-uniform hypergraph with n vertices and cn edges, w...
<p>We consider the problem of <em>k</em>-colouring a random <em>r</em>-uniform hypergraph with <em>n...
We consider the problem of k-colouring a random r-uniform hypergraph with n vertices and cn edges, w...
For a pair of integers 1 < r, the -chromatic number of an r-uniform hypergraph H = (V; E) is t...
For a pair of integers 1 fl ! r, the fl-chromatic number of an r-uniform hypergraph H = (V; E) is ...
Abstract. A2-coloring of a hypergraph is a mapping from its vertices to a set of two colors such tha...
We study graph parameters arising from different types of colourings of random graphs, defined broad...
AbstractIn this work we show that, for any fixed d, random d-regular graphs asymptotically almost su...
The chromatic number χ(G) of a graph G is defined as the minimum number of colours required for a ve...
AbstractWhen we wish to compute lower bounds for the chromatic number χ(G) of a graph G, it is of in...
The choice number of a hypergraph H = (V, E) is the least integer s for which for every family of co...
Given d let k d be the smallest integer k such that d < 2k log k. We prove that the chromatic...
We study problems related to the chromatic number of a random intersection graph G (n,m, p). We intr...
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...
We consider the problem of k-colouring a random r-uniform hypergraph with n vertices and cn edges, w...
<p>We consider the problem of <em>k</em>-colouring a random <em>r</em>-uniform hypergraph with <em>n...
We consider the problem of k-colouring a random r-uniform hypergraph with n vertices and cn edges, w...
For a pair of integers 1 < r, the -chromatic number of an r-uniform hypergraph H = (V; E) is t...
For a pair of integers 1 fl ! r, the fl-chromatic number of an r-uniform hypergraph H = (V; E) is ...
Abstract. A2-coloring of a hypergraph is a mapping from its vertices to a set of two colors such tha...
We study graph parameters arising from different types of colourings of random graphs, defined broad...
AbstractIn this work we show that, for any fixed d, random d-regular graphs asymptotically almost su...
The chromatic number χ(G) of a graph G is defined as the minimum number of colours required for a ve...
AbstractWhen we wish to compute lower bounds for the chromatic number χ(G) of a graph G, it is of in...
The choice number of a hypergraph H = (V, E) is the least integer s for which for every family of co...
Given d let k d be the smallest integer k such that d < 2k log k. We prove that the chromatic...
We study problems related to the chromatic number of a random intersection graph G (n,m, p). We intr...
DOI
Add to ORKG