166 citations · 387 across the 14 of their papers we have counts for
3 papers · 2 filters
The entropy of random-free graphons and properties
Hamed Hatami, Serguei Norine
Every graphon defines a random graph on any given number of vertices. It was known that the graphon is random-free if and only if the entropy of this random graph is subquadrat…
K_6 minors in large 6-connected graphs
Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas +1
Jorgensen conjectured that every 6-connected graph with no K_6 minor has a vertex whose deletion makes the graph planar. We prove the conjecture for all sufficiently large graphs.
K_6 minors in 6-connected graphs of bounded tree-width
Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas +1
We prove that every sufficiently big 6-connected graph of bounded tree-width either has a K_6 minor, or has a vertex whose deletion makes the graph planar. This is a step toward pr…