Bernd Kreuter

Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth

Stefan Hougardy, Thomas Emden-Weinert, Bernd Kreuter, 1998, Combinatorics, Probability and Computing.

The Width of Random Subsets of Boolean Lattices

Yoshiharu Kohayakawa, Bernd Kreuter, Y. Kohayakawa, 2002, J. Comb. Theory A.

Threshold functions for asymmetric Ramsey properties involving cycles

Yoshiharu Kohayakawa, Bernd Kreuter, Y. Kohayakawa, 1997, Random Struct. Algorithms.

Threshold functions for asymmetric Ramsey properties with respect to vertex colorings

B. Kreuter, Bernd Kreuter, 1996, Random Struct. Algorithms.

The length of random subsets of Boolean lattices

Y. Kohayakawa, B. Kreuter, D. Osthus, 2000, Random Struct. Algorithms.

Small sublattices in random subsets of Boolean lattices

Bernd Kreuter, 1998, Random Struct. Algorithms.