Theo dõi
Michael Krivelevich
Michael Krivelevich
Professor of Mathematics, Tel Aviv University
Email được xác minh tại post.tau.ac.il - Trang chủ
Tiêu đề
Trích dẫn bởi
Trích dẫn bởi
Năm
Finding a large hidden clique in a random graph
N Alon, M Krivelevich, B Sudakov
Random Structures & Algorithms 13 (3‐4), 457-466, 1998
5211998
Efficient testing of large graphs
N Alon, E Fischer, M Krivelevich, M Szegedy
Combinatorica 20 (4), 451-476, 2000
4802000
Pseudo-random graphs
M Krivelevich, B Sudakov
More sets, graphs and numbers: A Salute to Vera Sos and András Hajnal, 199-262, 2006
4592006
The rainbow connection of a graph is (at most) reciprocal to its minimum degree
M Krivelevich, R Yuster
Journal of Graph Theory 63 (3), 185-191, 2010
3012010
The largest eigenvalue of sparse random graphs
M Krivelevich, B Sudakov
Combinatorics, Probability and Computing 12 (1), 61-72, 2003
2392003
Regular languages are testable with a constant number of queries
N Alon, M Krivelevich, I Newman, M Szegedy
SIAM Journal on Computing 30 (6), 1842-1862, 2001
1982001
Turán numbers of bipartite graphs and related Ramsey-type questions
N Alon, M Krivelevich, B Sudakov
Combinatorics, Probability and Computing 12 (5-6), 477-494, 2003
1742003
Testing reed-muller codes
N Alon, T Kaufman, M Krivelevich, S Litsyn, D Ron
IEEE Transactions on Information Theory 51 (11), 4032-4039, 2005
1732005
Positional games
D Hefetz, M Krivelevich, M Stojaković, T Szabó
Birkhäuser, 2014
1722014
On the concentration of eigenvalues of random symmetric matrices
N Alon, M Krivelevich, VH Vu
Israel Journal of Mathematics 131, 259-267, 2002
1672002
Coloring graphs with sparse neighborhoods
N Alon, M Krivelevich, B Sudakov
Journal of Combinatorial Theory, Series B 77 (1), 73-82, 1999
1561999
The concentration of the chromatic number of random graphs
N Alon, M Krivelevich
Combinatorica 17 (3), 303-313, 1997
1401997
Testing Low-Degree Polynomials over GF(2)
N Alon, T Kaufman, M Krivelevich, S Litsyn, D Ron
International Workshop on Randomization and Approximation Techniques in …, 2003
1392003
Random regular graphs of high degree
M Krivelevich, B Sudakov, VH Vu, NC Wormald
Random Structures & Algorithms 18 (4), 346-363, 2001
1352001
The phase transition in random graphs: A simple proof
M Krivelevich, B Sudakov
Random Structures & Algorithms 43 (2), 131-138, 2013
1322013
Testing k-colorability
N Alon, M Krivelevich
SIAM Journal on Discrete Mathematics 15 (2), 211-227, 2002
1302002
Sparse pseudo‐random graphs are Hamiltonian
M Krivelevich, B Sudakov
Journal of Graph Theory 42 (1), 17-33, 2003
1292003
Tight bounds for testing bipartiteness in general graphs
T Kaufman, M Krivelevich, D Ron
SIAM Journal on computing 33 (6), 1441-1483, 2004
1242004
Variations on cops and robbers
A Frieze, M Krivelevich, PS Loh
Journal of Graph Theory 69 (4), 383-402, 2012
1232012
The critical bias for the Hamiltonicity game is (1+ 𝑜 (1)) 𝑛/ln𝑛
M Krivelevich
Journal of the American Mathematical Society 24 (1), 125-131, 2011
1092011
Hệ thống không thể thực hiện thao tác ngay bây giờ. Hãy thử lại sau.
Bài viết 1–20