Cite
HARVARD Citation
Cherkashin, D. et al. (2015). A note on random greedy coloring of uniform hypergraphs. Random structures & algorithms. 47 (3), pp. 407-413. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Cherkashin, D. et al. (2015). A note on random greedy coloring of uniform hypergraphs. Random structures & algorithms. 47 (3), pp. 407-413. [Online].