25 citations · 246 across the 55 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
math.CO2021
Weak diameter coloring of graphs on surfaces
Zdeněk Dvořák, Sergey Norin
Consider a graph drawn on a fixed surface, and assign to each vertex a list of colors of size at least two if is triangle-free and at least three otherwise. We prove that w…
math.CO2021★ 2 cited
Extremal functions for sparse minors
Kevin Hendrey, Sergey Norin, David R. Wood
The "extremal function" of a graph is the supremum of densities of graphs not containing as a minor, where the "density" of a graph is the ratio of the number of…
math.CO2021
Typical structure of hereditary properties of binary matroids
Stefan Grosser, Hamed Hatami, Peter Nelson +1
We prove an arithmetic analogue of the typical structure theorem for graph hereditary properties due to Alon, Balogh, Bollobás and Morris.