Gal Kronenberg

collaborators

3 papers

math.CO2019

Turán-type problems for long cycles in random and pseudo-random graphs

Michael Krivelevich, Gal Kronenberg, Adva Mond

We study the Turán number of long cycles in random graphs and in pseudo-random graphs. Denote by $e x (G (n, p), H)$ the random variable counting the number of edges in a largest subgra…

math.CO2019

The maximum length of $K_{r}$ -Bootstrap Percolation

József Balogh, Gal Kronenberg, Alexey Pokrovskiy +1

Graph-bootstrap percolation, also known as weak saturation, was introduced by Bollobás in 1968. In this process, we start with initial "infected" set of edges $E_{0}$ , and we infect…

math.CO2019

$H$ -games played on vertex sets of random graphs

Gal Kronenberg, Adva Mond, Alon Naor

We introduce a new type of positional games, played on a vertex set of a graph. Given a graph $G$ , two players claim vertices of $G$ , where the outcome of the game is determined by…

Turán-type problems for long cycles in random and pseudo-random graphs

The maximum length of Kr​-Bootstrap Percolation

H-games played on vertex sets of random graphs

The maximum length of $K_{r}$ -Bootstrap Percolation

$H$ -games played on vertex sets of random graphs