20 citations · 130 across the 33 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
math.CO2017★ 1 cited
Strong Ramsey Games in Unbounded Time
Stefan David, Ivailo Hartarsky, Marius Tiba
For two graphs and the strong Ramsey game on the board and with target is played as follows. Two players alternately claim edges of . The firs…
math.CO2017★ 3 cited
Maximal Bootstrap Percolation Time on the Hypercube via Generalised Snake-in-the-Box
Ivailo Hartarsky
In -neighbour bootstrap percolation, vertices (sites) of a graph are infected, round-by-round, if they have neighbours already infected. Once infected, they remain infec…