11 citations · 12 across the 6 of their papers we have counts for
10 papers
An improved upper bound on the maximum degree of terminal-pairable complete graphs
António Girão, Gábor Mészáros
A graph is terminal-pairable with respect to a demand multigraph on the same vertex set as , if there exists edge-disjoint paths joining the end vertices of every demand…
On the maximum diameter of path-pairable graphs
Antonio Girao, Gabor Meszaros, Kamil Popielarz +1
A graph is path-pairable if for any pairing of its vertices there exist edge disjoint paths joining the vertices in each pair. We obtain sharp bounds on the maximum possible diamet…
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…
Sorting using non-binary comparisons
Richard A. B. Johnson, Gabor Meszaros
In this paper we investigate the problem of sorting a set of coins, each with distinct but unknown weights, using an unusual scale. The classical version of this problem, which…
Frustrated Triangles
Teeradej Kittipassorn, Gabor Meszaros
A triple of vertices in a graph is a \emph{frustrated triangle} if it induces an odd number of edges. We study the set of possible number of frustrated…
Note on the Diameter of Path-Pairable Graphs
Gabor Meszaros
A graph on vertices is path-pairable if for any pairing of the vertices the pairs can be joined by edge-disjoint paths. The so far known families of path-pairable graphs have…
On Path-Pairability of Cartesian Product of Complete Bipartite Graphs
Gabor Meszaros
We study inheritance of path-pairability in the Cartesian product of graphs, and prove different (such as additive and multiplicative) inheritance patterns of path-pairability, dep…
On Linkedness of Cartesian Product of Graphs
Gabor Meszaros
We study linkedness of Cartesian product of graphs and prove that the product of an -linked and a -linked graphs is -linked if the graphs are sufficiently large. Fur…