![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Publisher: John Wiley & Sons Inc
E-ISSN: 1098-2418|47|3|407-413
ISSN: 1042-9832
Source: RANDOM STRUCTURES AND ALGORITHMS, Vol.47, Iss.3, 2015-10, pp. : 407-413
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)
![](/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)
Discrepancy of random graphs and hypergraphs
RANDOM STRUCTURES AND ALGORITHMS, Vol. 47, Iss. 1, 2015-08 ,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. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Tight Hamilton cycles in random hypergraphs
RANDOM STRUCTURES AND ALGORITHMS, Vol. 46, Iss. 3, 2015-05 ,pp. :