20 citations · 85 across the 26 of their papers we have counts for
7 papers · 1 filter
A new upper bound on the chromatic number of graphs with no odd minor
Sergey Norin, Zi-Xia Song
Gerards and Seymour conjectured that every graph with no odd minor is -colorable. This is a strengthening of the famous Hadwiger's Conjecture. Geelen et al. proved tha…
Breaking the degeneracy barrier for coloring graphs with no minor
Sergey Norin, Luke Postle, Zi-Xia Song
In 1943, Hadwiger conjectured that every graph with no minor is -colorable for every . In the 1980s, Kostochka and Thomason independently proved that every gr…
The smallest matroids with no large independent flat
Peter Nelson, Sergey Norin
We show that a simple rank- matroid with no -element independent flat has at least as many elements as the matroid defined as the direct sum of binary proje…
Bounding the number of cycles in a graph in terms of its degree sequence
Zdeněk Dvořák, Natasha Morrison, Jonathan A. Noel +2
We give an upper bound on the number of cycles in a simple graph in terms of its degree sequence, and apply this bound to resolve several conjectures of Király and Arman and Tsatur…
A lower bound on the average degree forcing a minor
Sergey Norin, Bruce Reed, Andrew Thomason +1
We show that for sufficiently large and for , there is a graph with average degree such that almost every graph with ver…
Asymptotic Density of Graphs Excluding Disconnected Minors
Rohan Kapadia, Sergey Norin, Yingjie Qian
For a graph , let where the maximum is taken over all graphs on vertices not containing as a minor. Thus…