Add to ORKGWe study rainbow-free colourings of k-uniform hypergraphs; that is, colourings that use k colours but with the property that no hyperedge attains all colours. We show that p⁎ = (k−1)(lnn)/n is the threshold function for the existence of a rainbow-free colouring in a random k-uniform hypergraph
A uniform hypergraph is properly k-colorable if each vertex is colored by one of k colors and no edg...
A hypergraph is properly 2-colorable if each vertex can be colored by one of two colors and no edge ...
A rainbow colouring of a connected graph is a colouring of the edges of the graph, such that every p...
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...
We consider the problem of k-colouring a random r-uniform hypergraph with n vertices and cn edges, w...
A hypergraph is k-rainbow colorable if there exists a vertex coloring using k colors such that each ...
<p>We consider the problem of <em>k</em>-colouring a random <em>r</em>-uniform hypergraph with <em>n...
A uniform hypergraph is properly k-colorable if each vertex is colored by one of k colors and no edg...
Fix r ≥ 2 and a collection of r-uniform hypergraphs H. What is the minimum number of edges in an H-f...
Fix r ≥ 2 and a collection of r-uniform hypergraphs H. What is the minimum number of edges in an H-f...
We consider edge colourings of the complete r-uniform hypergraph K n(r)on n vertices. How many colou...
We study graph parameters arising from different types of colourings of random graphs, defined broad...
We consider the problem of k-colouring a random r-uniform hypergraph with n vertices and cn edges, w...
A uniform hypergraph is properly k-colorable if each vertex is colored by one of k colors and no edg...
A hypergraph is properly 2-colorable if each vertex can be colored by one of two colors and no edge ...
A rainbow colouring of a connected graph is a colouring of the edges of the graph, such that every p...
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...
We consider the problem of k-colouring a random r-uniform hypergraph with n vertices and cn edges, w...
A hypergraph is k-rainbow colorable if there exists a vertex coloring using k colors such that each ...
<p>We consider the problem of <em>k</em>-colouring a random <em>r</em>-uniform hypergraph with <em>n...
A uniform hypergraph is properly k-colorable if each vertex is colored by one of k colors and no edg...
Fix r ≥ 2 and a collection of r-uniform hypergraphs H. What is the minimum number of edges in an H-f...
Fix r ≥ 2 and a collection of r-uniform hypergraphs H. What is the minimum number of edges in an H-f...
We consider edge colourings of the complete r-uniform hypergraph K n(r)on n vertices. How many colou...
We study graph parameters arising from different types of colourings of random graphs, defined broad...
We consider the problem of k-colouring a random r-uniform hypergraph with n vertices and cn edges, w...
A uniform hypergraph is properly k-colorable if each vertex is colored by one of k colors and no edg...
A hypergraph is properly 2-colorable if each vertex can be colored by one of two colors and no edge ...
A rainbow colouring of a connected graph is a colouring of the edges of the graph, such that every p...