15 citations · 53 across the 46 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
math.CO2020
Crossings between non-homotopic edges
János Pach, Gábor Tardos, Géza Tóth
We call a multigraph {\em non-homotopic} if it can be drawn in the plane in such a way that no two edges connecting the same pair of vertices can be continuously transformed into e…
math.CO2020
Convergence and limits of finite trees
Gábor Elek, Gábor Tardos
Motivated by the work of Lovász and Szegedy on the convergence and limits of dense graph sequences, we investigate the convergence and limits of finite trees with respect to sampli…
math.CO2020
Turán problems for Edge-ordered graphs
Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy +3
In this paper we initiate a systematic study of the Turán problem for edge-ordered graphs. A simple graph is called , if its edges are linearly ordered. An i…