Gábor Tardos

collaborators

2 papers

math.CO2026

Unavoidable patterns and plane paths in dense topological graphs

BalÃ¡zs Keszegh, Andrew Suk, GÃ¡bor Tardos +1

Let $C_{s, t}$ be the complete bipartite geometric graph, with $s$ and $t$ vertices on two distinct parallel lines respectively, and all $s t$ straight-line edges drawn between them…

math.CO2024

Tight bounds for intersection-reverse sequences, edge-ordered graphs and applications

BarnabÃ¡s Janzer, Oliver Janzer, Abhishek Methuku +1

In 2006, Marcus and Tardos proved that if $A^{1}, \dots, A^{n}$ are cyclic orders on some subsets of a set of $n$ symbols such that the common elements of any two distinct orders $A^{i}$ a…