
On the optimality of the uniform random
strategy (with Ch. Kusch, J. Rue, Ch. Spiegel),
submitted.

A family of extremal
hypergraphs for Ryser's conjecture
(with A. AbuKhazneh, J. Barát, A. Pokrovskiy),
submitted.

Extremal hypergraphs for Ryser's conjecture
(with P. Haxell, L. Narins), submitted.

Vertex Folkman numbers and the minimum degree of
minimal Ramsey graphs (with H. Hàn, V. Rödl), SIAM Journal on Discrete Mathematics, to appear.

Graphs without proper subgraphs of minimum degree 3 and short cycles
(with L. Narins, A. Pokrovskiy), Combinatorica 37(3)
(2017), 495519.

Sharp thresholds for halfrandom games II.
(with J. Groschwitz)
Graphs and Combinatorics 33 (2017), 387401

On the minimum degree of
minimal Ramsey graphs for multiple colours
(with J.Fox, A. Grinshpun, A. Liebenau, Y. Person),
Journal of Combinatorial Theory (Series B), 120
(2016), 6482.

The Local Lemma is tight for SAT
(with H. Gebauer, G. Tardos), Journal of the ACM 63(5) (2016), No. 43.
An
extended abstract appeared in
22nd Annual ACMSIAM Symposium on Discrete Algorithms (SODA)(2011), 664674.

Sharp thresholds for halfrandom games I.
(with J. Groschwitz),
Random Structures and Algorithms, 49(4) (2016), 766794.

Free edge lengths in plane graphs
(with Z. Abel, R. Connelly, S. Eisenstat, R.
Fulek, F. Morić, Y. Okamoto, Cs. Tóth),
Discrete \& Computational Geometry, 54(1) (2015), 259289.
An extended abstract appeared in
Proc. 30th Annual Symposium on Computational
Geometry (SoCG 2014, Kyoto), ACM Press, 426435.

On the concentration of the domination number of the random graph
(with R. Glebov, A. Liebenau), SIAM Journal of Discrete Mathematics,
29(3) (2015), 11861206.

What is Ramsey equivalent to a clique?
(with J. Fox, A. Grinshpun, A. Liebenau, Y. Person), Journal of
Combinatorial Theory (Series B), 109 (2014), 120133.

On the rank of higher inclusion matrices
(with C. Grosu, Y. Person), Journal of the London Mathematical
Society, 90 (2014) 333349.

Positional Games (with D. Hefetz, M. Krivelevich,
M. Stojaković), Oberwolfach Seminars, Volume 44,
Springer, 2014.

How many colors guarantee a rainbow matching?
(with R. Glebov, B. Sudakov), Electronic Journal of
Combinatorics 21(1) (2014), P1.27.

On conflictfree coloring of graphs
(with R. Glebov, G. Tardos),
Combinatorics, Probability, and Computing, 23(2014), 434448.

On covering expander graphs with Hamilton cycles
(with R. Glebov, M. Krivelevich),
Random Structures and Algorithms, 44(2014), 183200.

Sharp threshold for the appearance of certain spanning trees in random graphs
(with D. Hefetz, M. Krivelevich),
Random Structures and Algorithms 41(2012), 391412.

Bounded transversals in multipartite graphs
(with R. Berke, P. Haxell),
Journal of Graph Theory 70(2012) 318331.

Global MakerBreaker games on sparse graphs
(with D. Hefetz, M. Krivelevich, M. Stojaković),
European Journal of Combinatorics, 32(2011), 162177.

On the minimum degree of minimal Ramsey graphs
(with P. Zumstein, S. Zürcher),
Journal of Graph Theory, 64(2010), 150164.

AvoiderEnforcer: the rules of the game
(with D. Hefetz, M. Krivelevich, M. Stojaković),
Journal of Combinatorial Theory (Series A), 117
(2010), 152163.

Asymptotic random graph intuition for the biased connectivity game
(with H. Gebauer),
Random Structures and Algorithms , 35
(2009), 431443.

A sharp threshold for the
Hamilton cycle MakerBreaker game
(with D. Hefetz, M. Krivelevich, M. Stojaković),
Random Structures and Algorithms, 34
(2009) 112122.

Vizing's Conjecture for chordal graphs
(with R. Aharoni)
Discrete Mathematics, 309
(2009), 17661768.

Hamilton cycles in highly connected and expanding graphs
(with D. Hefetz, M. Krivelevich),
Combinatorica ,29
(2009), 547568.

Deciding relaxed twocolorability  a hardness jump
(with R. Berke),
Combinatorics, Probability, and Computing, 18
(2009), 5381.
An extended abstract appeared in
Proc. 14th Annual European Symposium on Algorithms (ESA),
(2006) 124135.

Fast winning strategies in MakerBreaker games
(with D. Hefetz, M. Krivelevich, M. Stojaković),
Journal of Combinatorial Theory (Series B),
99
(2009), 3947.

Fast winning strategies in AvoiderEnforcer games
(with D. Hefetz, M. Krivelevich, M. Stojaković)
Graphs and Combinatorics, 25(2009), 533544.

How long can a graph be kept planar?
(with V. Anuradha, C. Jain, J. Snoeyink),
Electronic Journal of Combinatorics, 15(1) (2008), N14.
An extended abstract appeared at the 17th Fall Workshop
on Computational and Combinatorial Geometry.

Biased positional games and small hypergraphs with large covers
(with M. Krivelevich)
Electronic Journal of Combinatorics, 15(1) (2008), R70.

Planarity, coloring and minor games
(with D. Hefetz, M. Krivelevich, M. Stojaković),
SIAM Journal on Discrete Mathematics, 22
(2008), 194212.

Turán's theorem in the hypercube
(with N. Alon, A. Krech),
SIAM Journal on Discrete Mathematics, 21
(2007), 6672.

BartMoe games, JumbleG and Discrepancy
(with D. Hefetz, M. Krivelevich),
European Journal of Combinatorics, 28,
(2007), 11311143.

AvoiderEnforcer games (with D. Hefetz, M. Krivelevich),
Journal of Combinatorial Theory (Series A), 114
(2007), 840853.

Relaxed twocoloring of cubic graphs (with R. Berke),
Journal of Combinatorial Theory (Series B), 97 (2007),
652668.
An extended abstract appeared in
European Conference on Combinatorics, Graph Theory,
and Applications (EUROCOMB) (2005) 341344.

RANDOM EDGE can be exponential on abstract cubes,
(with J. Matoušek)
Advances in Mathematics, 204(2006) 262277.
An extended abstract appeared in
Proc. 45nd Ann. IEEE Symp. on Foundations of Computer Science
(FOCS),
(2004), 92100.

Odd independent transversals are odd, (with P. Haxell)
Combinatorics, Probability and Computing,
15 (2006), 193211.

Extremal problems for transversals in graphs with bounded degree,
(with G. Tardos),
Combinatorica, 26 (2006) 333351.

The game of JumbleG,
(with A. Frieze, M. Krivelevich, O. Pikhurko),
Combinatorics, Probability and Computing,
14 (2005) 783793.

Jumping doesn't help in abstract cubes, (with I. Schurr)
Eleventh Conference on Integer Programming and Combinatorial Optimization (IPCO)
(2005),
225235.

Discrepancy games (with N. Alon, M. Krivelevich, J. Spencer),
Electronic Journal of Combinatorics, 12(2005), R51.

Positional games on random graphs, (with M. Stojaković)
Random Structures & Algorithms,
26 (2005) 204223.

A generalization of Turán's theorem,
(with B. Sudakov and V.H. Vu),
Journal of Graph Theory,
49 (2005), 187195.

Exact kwise intersection theorems, (with V.H. Vu),
Graphs and Combinatorics,
21 (2005), 247261.

Triangle factors in sparse pseudorandom graphs,
(with M. Krivelevich, B. Sudakov),
Combinatorica,
24 no.3. (2004) 403426.

Finding the sink takes some time, (with I. Schurr),
Discrete and Computational Geometry,
31 (2004) 627642.
An extended abstract appeared in
Proc. 10th European Symposium on Algorithms (ESA),
Lecture Notes in Computer Science 2461 (2002) 833844.

On the spectrum of projective normgraphs,
Information Processing Letters,
86 no. 2. (2003) 7174.

Bounded size components  partitions and transversals,
(with P. Haxell, G. Tardos),
Journal of Combinatorial Theory, (Series B),
88 no.2. (2003) 281297.

Turán's theorem in sparse random graphs, (with V.H. Vu)
Random Structures & Algorithms,
23 no.3. (2003) 225234.

Unique sink orientations of cubes, (with E. Welzl),
Proc. 42nd Ann. IEEE Symp. on Foundations of Computer
Science (FOCS),
(2001) 547555.

A multidimensional generalization of the ErdősSzekeres lemma on
monotone subsequences, (with G. Tardos),
Combinatorics, Probability and Computing,
10 (2001), 557565.

Normgraphs: Variations and Applications,
(with N. Alon and L. Rónyai)
Journal of Combinatorial Theory, (Series B),
76 (1999), 280290.

On Erdős' Eulerian Trail Game, (with Á. Seress)
Graphs and Combinatorics,
15 (1999), 233237.

Intersection Properties of Subsets of Integers,
European Journal of Combinatorics,
20 (1999), 429444.

On Nearly Regular Cocritical Graphs,
Discrete Mathematics,
160 (1996) 279281.

Normgraphs and Bipartite Turán Numbers
(with J. Kollár and L. Rónyai),
Combinatorica, 16 (1996), no. 3, 399406.
An extended abstract appeared in
Extremal Bipartite Graphs and Superpolynomial Lower Bounds for Monotone
Span Programs, (with L. Babai, A. Gál, J. Kollár,
L. Rónyai and A. Wigderson)
Proc. of the twentyeighth Annual ACM
Symposium on the Theory of Computing (STOC),
(1996), 603611.

Dense Graphs with Cycle Neighborhoods (with Á. Seress),
Journal of Combinatorial Theory (Series B),
63 (1995) 281293.
Last modified: Fri Jan 26 06:16:53 CET 2018