11 citations · 12 across the 6 of their papers we have counts for
3 papers · 1 filter
On a conjecture of Gentner and Rautenbach
António Girão, Gábor Mészáros, Stephen G. Z. Smith
Gentner and Rautenbach conjectured that the size of a minimum zero forcing set in a connected graph on vertices with maximum degree is at most . We disprove…
Line Percolation in Finite Projective Planes
Dániel Gerbner, Balázs Keszegh, Gábor Mészáros +2
We study combinatorial parameters of a recently introduced bootstrap percolation problem in finite projective planes. We present sharp results on the size of the minimum percolatin…
Note on Terminal-Pairability in Complete Grid Graphs
Ervin Györi, Tamás Róbert Mezei, Gábor Mészáros
We affirmatively answer and generalize the question of Kubicka, Kubicki and Lehel concerning the path-pairability of high-dimensional complete grid graphs. As an intriguing by-prod…