A note on random greedy coloring of uniform hypergraphs

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.

Previous Menu Next

Abstract

Related content

Approximating Coloring and Maximum Independent Sets in 3-Uniform Hypergraphs

By Krivelevich M.   Nathaniel R.   Sudakov B.  

Journal of Algorithms, Vol. 41, Iss. 1, 2001-10 ,pp. : 99-113

Academic Press

Access to resources Recommend Favorite

List coloring triangle‐free hypergraphs

By  

RANDOM STRUCTURES AND ALGORITHMS, Vol. 47, Iss. 3, 2015-10 ,pp. : 487-519

John Wiley & Sons Inc

Access to resources Recommend Favorite

Discrepancy of random graphs and hypergraphs

By  

RANDOM STRUCTURES AND ALGORITHMS, Vol. 47, Iss. 1, 2015-08 ,pp. : 147-162

John Wiley & Sons Inc

Access to resources Recommend Favorite

Approximate Set Covering in Uniform Hypergraphs

By Krivelevich M.  

Journal of Algorithms, Vol. 25, Iss. 1, 1997-10 ,pp. : 118-143

Academic Press

Access to resources Recommend Favorite

Tight Hamilton cycles in random hypergraphs

By  

RANDOM STRUCTURES AND ALGORITHMS, Vol. 46, Iss. 3, 2015-05 ,pp. : 446-465

John Wiley & Sons Inc

Access to resources Recommend Favorite