25 citations · 246 across the 55 of their papers we have counts for
7 papers · 1 filter
Every graph is eventually Turán-good
Natasha Morrison, JD Nir, Sergey Norin +2
Let be a graph. We show that if is large enough as a function of , then the -partite Turán graph maximizes the number of copies of among all -free graphs…
The Burning Number Conjecture Holds Asymptotically
Sergey Norin, Jérémie Turcotte
The burning number of a graph is the smallest number of turns required to burn all vertices of a graph if at every turn a new fire is started and existing fires spread t…
Dense minors of graphs with independence number two
Sergey Norin, Paul Seymour
Motivated by Hadwiger's conjecture, we prove that every -vertex graph with no independent set of size three contains an -vertex simple minor with $$0.9…
The Spectrum of Triangle-free Graphs
József Balogh, Felix Christian Clemen, Bernard Lidický +2
Denote by the smallest eigenvalue of the signless Laplacian matrix of an -vertex graph . Brandt conjectured in 1997 that for regular triangle-free graphs $q_n(G) \le…
Three-dimensional graph products with unbounded stack-number
David Eppstein, Robert Hickingbotham, Laura Merker +3
We prove that the stack-number of the strong product of three -vertex paths is . The best previously known upper bound was . No non-trivial lower bound was kno…
Asymptotic dimension of intersection graphs
Zdeněk Dvořák, Sergey Norin
We show that intersection graphs of compact convex sets in R^n of bounded aspect ratio have asymptotic dimension at most 2n+1. More generally, we show this is the case for intersec…
Testability and local certification of monotone properties in minor-closed classes
Louis Esperet, Sergey Norin
The main problem in the area of graph property testing is to understand which graph properties are \emph{testable}, which means that with constantly many queries to any input graph…