On the Number of Solutions in Random Hypergraph 2-Colouring
نویسنده
چکیده
We determine the limiting distribution of the logarithm of the number of satisfying assignments in the random k-uniform hypergraph 2-colouring problem in a certain density regime for all k > 3. As a direct consequence we obtain that in this regime the random colouring model is contiguous with respect to the planted model, a result that helps simplifying the transfer of statements between these two models.
منابع مشابه
A Random Recolouring Method for Graphs and Hypergrams
We consider a simple randomised algorithm that seeks a weak 2colouring of a hypergraph H; that is, it tries to 2-colour the points of H so that no edge is monochromatic. If H has a particular well-behaved form of such a colouring, then the method is successful within expected number of iterations O(n3), when H has n points. In particular, when applied to a graph G with n nodes and chromatic num...
متن کاملProperly 2-Colouring Linear Hypergraphs
Using the symmetric form of the Lovász Local Lemma, one can conclude that a k-uniform hypergraph H admits a proper 2-colouring if the maximum degree (denoted by ∆) of H is at most 2 8k independently of the size of the hypergraph. However, this argument does not give us an algorithm to find a proper 2-colouring of such hypergraphs. We call a hypergraph linear if no two hyperedges have more than ...
متن کاملOn the Chromatic Index of Random Uniform Hypergraphs
Let H(n,N), where k ≥ 2, be a random hypergraph on the vertex set [n] = {1, 2, . . . , n} with N edges drawn independently with replacement from all subsets of [n] of size k. For d̄ = kN/n and any ε > 0 we show that if k = o(ln(d̄/ lnn)) and k = o(ln(n/ ln d̄)), then with probability 1−o(1) a random greedy algorithm produces a proper edge-colouring of H(n,N) with at most d̄(1+ε) colours. This yield...
متن کاملOn the chromatic number of a random hypergraph
We consider the problem of k-colouring a random r-uniform hypergraph with n verticesand cn edges, where k, r, c remain constant as n → ∞. Achlioptas and Naor showed that thechromatic number of a random graph in this setting, the case r = 2, must have one of twoeasily computable values as n→∞. We give a complete generalisation of this result to randomuniform hypergraphs.
متن کاملNear-optimal list colorings
We show that a simple variant of a naive colouring procedure can be used to list colour the edges of a k-uniform linear hypergraph of maximum degree provided every vertex has a list of at least +c(log) 4 1? 1 k available colours (where c is a constant which depends on k). We can extend this to colour hypergraphs of maximum codegree o(() with + o(() colours. This improves earlier results of Kahn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 24 شماره
صفحات -
تاریخ انتشار 2017