Dan Hefetz

Random Struct. Algorithms, December, 2023

Rainbow trees in uniformly edge-colored graphs.

[BibT_eX]

[DOI]

Abhiruk Lahiri

Random Struct. Algorithms, March, 2023

Smoothed Analysis of the Komlós Conjecture: Rademacher Noise.

[BibT_eX]

[DOI]

Michael Trushkin

CoRR, 2023

2022

Large Rainbow Cliques in Randomly Perturbed Dense Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., December, 2022

Small rainbow cliques in randomly perturbed dense graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2022

On the Local Structure of Oriented Graphs - a Case Study in Flag Algebras.

[BibT_eX]

[DOI]

Electron. J. Comb., 2022

2021

Rainbow Hamilton Cycles in Randomly Colored Randomly Perturbed Dense Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

2020

Semi-random graph process.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2020

Very fast construction of bounded-degree spanning graphs via the semi-random graph process.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2020

Edge-statistics on large graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2020

2018

Ramsey-nice families of graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2018

Spanning-Tree Games.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

2017

Strong Ramsey games: Drawing on an infinite board.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2017

On the inducibility of cycles.

[BibT_eX]

[DOI]

Mykhaylo Tyomkyn

Electron. Notes Discret. Math., 2017

Waiter-Client and Client-Waiter Hamiltonicity games on random graphs.

[BibT_eX]

[DOI]

Wei En Tan

Eur. J. Comb., 2017

On degree anti-Ramsey numbers.

[BibT_eX]

[DOI]

Shoni Gilboa

Eur. J. Comb., 2017

2016

Random directed graphs are robustly Hamiltonian.

[BibT_eX]

[DOI]

Malgorzata Bednarska-Bzdega

Angelika Steger

Benny Sudakov

Random Struct. Algorithms, 2016

Picker-Chooser fixed graph games.

[BibT_eX]

[DOI]

Tomasz Luczak

J. Comb. Theory, Ser. B, 2016

On saturation games.

[BibT_eX]

[DOI]

Eur. J. Comb., 2016

Waiter-Client and Client-Waiter planarity, colorability and minor games.

[BibT_eX]

[DOI]

Wei En Tan

Discret. Math., 2016

Universality of Graphs with Few Triangles and Anti-Triangles.

[BibT_eX]

[DOI]

Malgorzata Bednarska-Bzdega

Mykhaylo Tyomkyn

Comb. Probab. Comput., 2016

Manipulative Waiters with Probabilistic Intuition.

[BibT_eX]

[DOI]

Tomasz Luczak

Comb. Probab. Comput., 2016

Polynomial Lower Bound for Distributed Graph Coloring in a Weak LOCAL Model.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 30th International Symposium, 2016

2015

Building Spanning Trees Quickly in Maker-Breaker Games.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

2014

Weak and strong <i>k</i>k-connectivity games.

[BibT_eX]

[DOI]

Asaf Ferber

Eur. J. Comb., 2014

Optimal covers with Hamilton cycles in random graphs.

[BibT_eX]

[DOI]

Comb., 2014

2013

A hypergraph Turán theorem via lagrangians of intersecting families.

[BibT_eX]

[DOI]

Peter Keevash

J. Comb. Theory, Ser. A, 2013

2012

Sharp threshold for the appearance of certain spanning trees in random graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2012

Hitting time results for Maker-Breaker games.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2012

Doubly Biased Maker-Breaker Connectivity Game.

[BibT_eX]

[DOI]

Mirjana Mikalacki

Milos Stojakovic

Electron. J. Comb., 2012

2011

On two generalizations of the Alon-Tarsi polynomial method.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2011

Fast embedding of spanning trees in biased Maker-Breaker games.

[BibT_eX]

[DOI]

Asaf Ferber

Electron. Notes Discret. Math., 2011

Global Maker-Breaker games on sparse graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2011

Winning Strong Games through Fast Strategies for Weak Games.

[BibT_eX]

[DOI]

Asaf Ferber

Electron. J. Comb., 2011

2010

An application of the combinatorial Nullstellensatz to a graph labelling problem.

[BibT_eX]

[DOI]

Annina Saluz

Huong T. T. Tran

J. Graph Theory, 2010

On antimagic directed graphs.

[BibT_eX]

[DOI]

Torsten Mütze

Justus Schwartz

J. Graph Theory, 2010

2009

A sharp threshold for the Hamilton cycle Maker-Breaker game.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2009

Fast winning strategies in Maker-Breaker games.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2009

Fast Winning Strategies in Avoider-Enforcer Games.

[BibT_eX]

[DOI]

Graphs Comb., 2009

Avoider-Enforcer: The Rules of the Game.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Playing to retain the advantage.

[BibT_eX]

[DOI]

Noga Alon

Electron. Notes Discret. Math., 2009

On Two Problems Regarding the Hamiltonian Cycle Game.

[BibT_eX]

[DOI]

Sebastian U. Stich

Electron. J. Comb., 2009

Hamilton cycles in highly connected and expanding graphs.

[BibT_eX]

[DOI]

Comb., 2009

2008

Planarity, Colorability, and Minor Games.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2008

2007

Positional games on graphs

[BibT_eX]

[DOI]

PhD thesis, 2007

Avoider-Enforcer games.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2007

Fast winning strategies in positional games.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

Bart-Moe games, JumbleG and discrepancy.

[BibT_eX]

[DOI]

Eur. J. Comb., 2007

2005

Anti-magic graphs via the Combinatorial NullStellenSatz.

[BibT_eX]

[DOI]