Randomly colouring simple hypergraphs

Details Randomly colouring simple hypergraphs Randomly colouring simple hypergraphs

2009-01-23

arxiv.org/abs/0901.3699v1

Computer Science

Discrete Mathematics

Scientific paper

We study the problem of constructing a (near) random proper $q$-colouring of a simple k-uniform hypergraph with n vertices and maximum degree \Delta. (Proper in that no edge is mono-coloured and simple in that two edges have maximum intersection of size one). We give conditions on q,\Delta so that if these conditions are satisfied, Glauber dynamics will converge in O(n\log n) time from a random (improper) start. The interesting thing here is that for k\geq 3 we can take q=o(\D).

Affiliated with

Also associated with

No associations

Rating

Randomly colouring simple hypergraphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Randomly colouring simple hypergraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Randomly colouring simple hypergraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-66180