PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Krivelevich, Michael"

Author of the publication

copydeleteadd this publication to your clipboard
Two-coloring random hypergraphs.

, , , and . Random Struct. Algorithms, 20 (2): 249-259 (2002)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Michael Böhm

Michael Funk

Hon. -Prof. Dr. -Ing. Michael Bauer University of Stuttgart

Dr. Michael Wachowsky University of Stuttgart

Dr. phil. Michael Nerurkar University of Stuttgart

 

Other publications of authors with the same name

Deciding k-colorability in expected polynomial time.. Inf. Process. Lett., 81 (1): 1-6 (2002)Hamilton cycles in highly connected and expanding graphs., , and . Combinatorica, 29 (5): 547-568 (2009)On a Theorem of Lovász on Covers in tau-Partite Hypergraphs., , and . Combinatorica, 16 (2): 149-174 (1996)Sparse pseudo-random graphs are Hamiltonian., and . Journal of Graph Theory, 42 (1): 17-33 (2003)A note on regular Ramsey graphs., , and . Journal of Graph Theory, 64 (3): 244-249 (2010)Generating random graphs in biased Maker-Breaker games., , and . Random Struct. Algorithms, 47 (4): 615-634 (2015)On fractional K-factors of random graphs., and . Random Struct. Algorithms, 30 (4): 441-463 (2007)Avoiding small subgraphs in Achlioptas processes., , and . Random Struct. Algorithms, 34 (1): 165-195 (2009)Perfect fractional matchings in random hypergraphs.. Random Struct. Algorithms, 9 (3): 317-334 (1996)Sharp threshold for the appearance of certain spanning trees in random graphs., , and . Random Struct. Algorithms, 41 (4): 391-412 (2012)