Author:
Achlioptas Dimitris,Moore Cristopher
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Achlioptas, D., Kim, J.H., Krivelevich, M. AND Tetali, P. Two-coloring random hypergraphs. Random Structures Algorithms, 20(2):249–259, 2002.
2. Achlioptas, D., AND Moore, C. The asymptotic order of the random k-SAT threshold. To appear in 43rd Annual Symposium on Foundations of Computer Science (Vancouver, BC, 2002).
3. Alon, N., AND Spencer, J. A note on coloring random k-sets. Unpublished manuscript.
4. Beck, J. On 3-chromatic hypergraphs. Discrete Math. 24, 2 (1978), 127–137.
5. Berge, C.Hypergraphs. North-Holland Publishing Co., Amsterdam, 1989. Combinatorics of finite sets, Translated from the French.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Bounds on Threshold Probabilities for Coloring Properties of Random Hypergraphs;Problems of Information Transmission;2022-04
2. Hypergraph coloring up to condensation;Random Structures & Algorithms;2018-12-12
3. Charting the Replica Symmetric Phase;Communications in Mathematical Physics;2018-02-01
4. Colorings of Partial Steiner Systems and Their Applications;Journal of Mathematical Sciences;2015-03-26
5. Tight Bounds on the Threshold for Permuted k-Colorability;Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques;2012