![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Krivelevich M. Nathaniel R. Sudakov B.
Publisher: Academic Press
ISSN: 0196-6774
Source: Journal of Algorithms, Vol.41, Iss.1, 2001-10, pp. : 99-113
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
A note on random greedy coloring of uniform hypergraphs
RANDOM STRUCTURES AND ALGORITHMS, Vol. 47, Iss. 3, 2015-10 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
List coloring triangle‐free hypergraphs
RANDOM STRUCTURES AND ALGORITHMS, Vol. 47, Iss. 3, 2015-10 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Approximate Set Covering in Uniform Hypergraphs
Journal of Algorithms, Vol. 25, Iss. 1, 1997-10 ,pp. :