32 citations · 98 across the 35 of their papers we have counts for
5 papers · 1 filter
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…
On the Odd Cycle Game and Connected Rules
Jan Corsten, Adva Mond, Alexey Pokrovskiy +2
We study the positional game where two players, Maker and Breaker, alternately select respectively and previously unclaimed edges of . Maker wins if she succeeds in cl…
2-factors with k cycles in Hamiltonian graphs
Matija Bucić, Erik Jahn, Alexey Pokrovskiy +1
A well known generalisation of Dirac's theorem states that if a graph on vertices has minimum degree at least then contains a -factor consisting of exact…
Partitioning edge-coloured hypergraphs into few monochromatic tight cycles
Sebastián Bustamante, Jan Corsten, Nóra Frankl +2
Confirming a conjecture of Gyárfás, we prove that, for all natural numbers and , the vertices of every -edge-coloured complete -uniform hypergraph can be partitioned i…
Minimum degree conditions for monochromatic cycle partitioning
Dániel Korándi, Richard Lang, Shoham Letzter +1
A classical result of Erdős, Gyárfás and Pyber states that any -edge-coloured complete graph has a partition into monochromatic cycles. Here we determine the min…