An improved bound on the minimal number of edges in color-critical graphs. Krivelevich, Michael — 1998 The Electronic Journal of Combinatorics [electronic only]
Sparse graphs usually have exponentially many optimal colorings. Krivelevich, Michael — 2002 The Electronic Journal of Combinatorics [electronic only]
Biased positional games and small hypergraphs with large covers. Krivelevich, Michael; Szabó, Tibor — 2008 The Electronic Journal of Combinatorics [electronic only]
On rainbow trees and cycles. Frieze, Alan; Krivelevich, Michael — 2008 The Electronic Journal of Combinatorics [electronic only]
The number of F -matchings in almost every tree is a zero residue. Alon, Noga; Haber, Simi; Krivelevich, Michael — 2011 The Electronic Journal of Combinatorics [electronic only]
Perfectly balanced partitions of smoothed graphs. Ben-Eliezer, Ido; Krivelevich, Michael — 2009 The Electronic Journal of Combinatorics [electronic only]
Discrepancy games. Alon, Noga; Krivelevich, Michael; Spencer, Joel; Szabó, Tibor — 2005 The Electronic Journal of Combinatorics [electronic only]