Searching for authors named "Michael Krivelevich" – sorted by Relevance.
-
Deciding K-Colorability in Expected Polynomial Time
- Deciding k-colorability in expected polynomial time Michael Krivelevich Abstract For every xed k
- Cited by 3 (1 self) – Add To MetaCart
-
Coloring Random Graphs - an Algorithmic Perspective
- Coloring random graphs { an algorithmic perspective Michael Krivelevich 1 Introduction
- Cited by 5 (0 self) – Add To MetaCart
-
On the Minimal Number of Edges in Color-Critical Graphs
- On the minimal number of edges in color-critical graphs Michael Krivelevich Department
- Cited by 5 (4 self) – Add To MetaCart
-
Approximate Set Covering in Uniform Hypergraphs
- Approximate set covering in uniform hypergraphs Michael Krivelevich Department of Mathematics
- Cited by 3 (2 self) – Add To MetaCart
-
Sparse Graphs Usually Have Exponentially Many Optimal Colorings
- Sparse graphs usually have exponentially many optimal colorings Michael Krivelevich Abstract A
- Cited by 3 (0 self) – Add To MetaCart
-
An Improved Bound on the Minimal Number of Edges in Color-Critical Graphs
- An improved bound on the minimal number of edges in color-critical graphs Michael Krivelevich
- Cited by 2 (0 self) – Add To MetaCart
-
Biased positional games and small hypergraphs with large covers, submitted
- Biased Positional Games and Small Hypergraphs with Large Covers Michael Krivelevich * Tibor Szab
- Cited by 3 (2 self) – Add To MetaCart
-
The Choice Number of Dense Random Graphs
- The choice number of dense random graphs Michael Krivelevich Abstract We prove that if the edge
- Cited by 10 (8 self) – Add To MetaCart
-
Perfect Fractional Matchings in Random Hypergraphs
- Perfect fractional matchings in random hypergraphs Michael Krivelevich Department of Mathematics
- Cited by 3 (3 self) – Add To MetaCart
-
On The Edge Distribution In Triangle-Free Graphs
- ON THE EDGE DISTRIBUTION IN TRIANGLE-FREE GRAPHS Michael Krivelevich Abstract. Two problems
- Cited by 7 (0 self) – Add To MetaCart

