1 citations · 1 across the 2 of their papers we have counts for
7 papers · 1 filter
Long running times for hypergraph bootstrap percolation
Alberto Espuny Díaz, Barnabás Janzer, Gal Kronenberg +1
Consider the hypergraph bootstrap percolation process in which, given a fixed -uniform hypergraph and starting with a given hypergraph , at each step we add to al…
Independent sets in random subgraphs of the hypercube
Gal Kronenberg, Yinon Spinka
Let be the random subgraph of the -dimensional hypercube , where each edge is retained independently with probability . We study the asymptotic number of…
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 the random variable counting the number of edges in a largest subgra…
The maximum length of -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 , and we infect…
-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 , two players claim vertices of , where the outcome of the game is determined by…
Semi-random graph process
Omri Ben-Eliezer, Dan Hefetz, Gal Kronenberg +3
We introduce and study a novel semi-random multigraph process, described as follows. The process starts with an empty graph on vertices. In every round of the process, one vert…