most citedNote on Terminal-Pairability in Complete Grid Graphs

11 citations · 11 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2023

Constructing and sampling partite, -uniform hypergraphs with given degree sequence

Andras Hubai, Tamas Robert Mezei, Ferenc Beres +2

Partite, -uniform hypergraphs are -uniform hypergraphs in which each hyperedge contains exactly one point from each of the disjoint vertex classes. We consider the degree…

math.CO2016★ 11 cited

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…