Sergey Norin

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 45

Top Topics

Graph Theoretic

Nash Equilibria

Tree Decompositions

Top Venues

SIAM J. Discret. Math.

J. Comb. Theory, Ser. B

Publications

Sergey Norin, Jérémie Turcotte
The burning number conjecture holds asymptotically. J. Comb. Theory B 168 (2024)
Ping Hu, Jie Ma, Sergey Norin, Hehui Wu
The inducibility of oriented stars. J. Comb. Theory B 168 (2024)
Zdenek Dvorák, Sergey Norin
Weak diameter coloring of graphs on surfaces. Eur. J. Comb. 121 (2024)
Maria Chudnovsky, Sergey Norin, Paul D. Seymour, Jérémie Turcotte
Cops and Robbers on \(\boldsymbol{P_5}\)-Free Graphs. SIAM J. Discret. Math. 38 (1) (2024)
David Eppstein, Robert Hickingbotham, Laura Merker, Sergey Norin, Michal T. Seweryn, David R. Wood
Three-Dimensional Graph Products with Unbounded Stack-Number. Discret. Comput. Geom. 71 (4) (2024)
Stefan Grosser, Hamed Hatami, Peter Nelson, Sergey Norin
Typical structure of hereditary properties of binary matroids. J. Comb. Theory B 167 (2024)
Sergey Norin, Robin Thomas, Hein van der Holst
On 2-cycles of graphs. J. Comb. Theory, Ser. B 162 (2023)
Sergey Norin, Luke Postle
minor. J. Comb. Theory, Ser. B 158 (Part) (2023)
Sergey Norin, Alex Scott, David R. Wood
Clustered colouring of graph classes with bounded treedepth or pathwidth. Comb. Probab. Comput. 32 (1) (2023)
Natasha Morrison, JD Nir, Sergey Norin, Pawel Rzazewski, Alexandra Wesolek
Every graph is eventually Turán-good. J. Comb. Theory, Ser. B 162 (2023)
Kevin Hendrey, Sergey Norin, Raphael Steiner, Jérémie Turcotte
Twin-width of sparse random graphs. CoRR (2023)
József Balogh, Bernard Lidický, Sergey Norin, Florian Pfender, Gelasio Salazar, Sam Spiro
Crossing numbers of complete bipartite graphs. LAGOS (2023)
Maria Chudnovsky, Sergey Norin, Paul D. Seymour, Jérémie Turcotte
-free graphs. CoRR (2023)
József Balogh, Felix Christian Clemen, Bernard Lidický, Sergey Norin, Jan Volec
The Spectrum of Triangle-Free Graphs. SIAM J. Discret. Math. 37 (2) (2023)
Adam Blumenthal, Bernard Lidický, Ryan R. Martin, Sergey Norin, Florian Pfender, Jan Volec
Counterexamples to a Conjecture of Harris on Hall Ratio. SIAM J. Discret. Math. 36 (3) (2022)
Daniel Král', Jonathan A. Noel, Sergey Norin, Jan Volec, Fan Wei
Non-Bipartite K-Common Graphs. Comb. 42 (1) (2022)
David Eppstein, Robert Hickingbotham, Laura Merker, Sergey Norin, Michal T. Seweryn, David R. Wood
Three-dimensional graph products with unbounded stack-number. CoRR (2022)
Louis Esperet, Sergey Norin
Testability and local certification of monotone properties in minor-closed classes. CoRR (2022)
Sergey Norin, Jérémie Turcotte
The Burning Number Conjecture Holds Asymptotically. CoRR (2022)
Ringi Kim, Sergey Norin, Sang-il Oum
Obstructions for partitioning into forests and outerplanar graphs. Discret. Appl. Math. 312 (2022)
Sergey Norin, Zi-Xia Song
Minor. Comb. 42 (1) (2022)
Louis Esperet, Sergey Norin
Testability and Local Certification of Monotone Properties in Minor-Closed Classes. ICALP (2022)
Ndiamé Ndiaye, Sergey Norin, Adrian Vetta
Descending the Stable Matching Lattice: How Many Strategic Agents Are Required to Turn Pessimality to Optimality? SAGT (2021)
Peter Nelson, Sergey Norin
The Smallest Matroids with no Large Independent Flat. Electron. J. Comb. 28 (1) (2021)
Zdenek Dvorák, Natasha Morrison, Jonathan A. Noel, Sergey Norin, Luke Postle
Bounding the number of cycles in a graph in terms of its degree sequence. Eur. J. Comb. 91 (2021)
Rohan Kapadia, Sergey Norin, Yingjie Qian
Asymptotic density of graphs excluding disconnected minors. J. Comb. Theory, Ser. B 146 (2021)
Zdenek Dvorák, Rose McCarty, Sergey Norin
Sublinear Separators in Intersection Graphs of Convex Shapes. SIAM J. Discret. Math. 35 (2) (2021)
Sergey Norin, Bruce A. Reed, Andrew Thomason, David R. Wood
A Lower Bound on the Average Degree Forcing a Minor. Electron. J. Comb. 27 (2) (2020)
Zdenek Dvorák, Sergey Norin, Luke Postle
List coloring with requests. J. Graph Theory 92 (3) (2019)
Zdenek Dvorák, Sergey Norin
Treewidth of graphs with balanced separations. J. Comb. Theory, Ser. B 137 (2019)
Sergey Norin, Alex Scott, Paul D. Seymour, David R. Wood
Clustered Colouring in Minor-Closed Classes. Comb. 39 (6) (2019)
Daniel Král', Sergey Norin, Jan Volec
A bound on the inducibility of cycles. J. Comb. Theory, Ser. A 161 (2019)
Adam Bene Watts, Sergey Norin, Liana Yepremyan
A Turán Theorem for Extensions Via an Erdős-Ko-Rado Theorem for Lagrangians. Comb. 39 (5) (2019)
Dmitry Jakobson, Calum MacRury, Sergey Norin, Lise Turner
Distribution of Coefficients of Rank Polynomials for Random Sparse Graphs. Electron. J. Comb. 25 (4) (2018)
Sergey Norin, Liana Yepremyan
Turán numbers of extensions. J. Comb. Theory, Ser. A 155 (2018)
Vida Dujmovic, Gwenaël Joret, Pat Morin, Sergey Norin, David R. Wood
Corrigendum: Orthogonal Tree Decompositions of Graphs. SIAM J. Discret. Math. 32 (4) (2018)
Vida Dujmovic, Gwenaël Joret, Pat Morin, Sergey Norin, David R. Wood
Orthogonal Tree Decompositions of Graphs. SIAM J. Discret. Math. 32 (2) (2018)
Eli Berger, Zdenek Dvorák, Sergey Norin
Treewidth of Grid Subsets. Comb. 38 (6) (2018)
Sergey Norin, Liana Yepremyan
Turán number of generalized triangles. J. Comb. Theory, Ser. A 146 (2017)
Jan Hladký, Daniel Král', Sergey Norin
Counting flags in triangle-free digraphs. Comb. 37 (1) (2017)
Endre Csóka, Irene Lo, Sergey Norin, Hehui Wu, Liana Yepremyan
The extremal function for disconnected minors. J. Comb. Theory, Ser. B 126 (2017)
Stavros Garoufalidis, Sergey Norin, Thao Vuong
Flag algebras and the stable coefficients of the Jones polynomial. Eur. J. Comb. 51 (2016)
Zdenek Dvorák, Sergey Norin
Strongly Sublinear Separators and Polynomial Expansion. SIAM J. Discret. Math. 30 (2) (2016)
Sergey Norin, Robin Thomas
Non-planar extensions of subdivisions of planar graphs. J. Comb. Theory, Ser. B 121 (2016)
Sergey Norin, Yelena Yuditsky
Erdős-Szekeres Without Induction. Discret. Comput. Geom. 55 (4) (2016)
Yogesh Anbalagan, Hao Huang, Shachar Lovett, Sergey Norin, Adrian Vetta, Hehui Wu
Large Supports are Required for Well-Supported Nash Equilibria. APPROX-RANDOM (2015)
Yogesh Anbalagan, Hao Huang, Shachar Lovett, Sergey Norin, Adrian Vetta, Hehui Wu
Large Supports are required for Well-Supported Nash Equilibria. CoRR (2015)
Sergey Norin, Liana Yepremyan
Sparse halves in dense triangle-free graphs. J. Comb. Theory, Ser. B 115 (2015)
Maria Chudnovsky, Sergey Norin, Bruce A. Reed, Paul D. Seymour
Excluding a Substar and an Antisubstar. SIAM J. Discret. Math. 29 (1) (2015)
Nicolas Bousquet, Sergey Norin, Adrian Vetta
A Near-Optimal Mechanism for Impartial Selection. CoRR (2014)
Nicolas Bousquet, Sergey Norin, Adrian Vetta
A Near-Optimal Mechanism for Impartial Selection. WINE (2014)
Zdenek Dvorák, Sergey Norin
Treewidth of graphs with balanced separations. CoRR (2014)
Yogesh Anbalagan, Sergey Norin, Rahul Savani, Adrian Vetta
Polylogarithmic Supports are required for Approximate Well-Supported Nash Equilibria below 2/3. CoRR (2013)
Yogesh Anbalagan, Sergey Norin, Rahul Savani, Adrian Vetta
Polylogarithmic Supports Are Required for Approximate Well-Supported Nash Equilibria below 2/3. WINE (2013)
Sergey Norin, Liana Yepremyan
Sparse halves in dense triangle-free graphs. Electron. Notes Discret. Math. 43 (2013)
Felix Brandt, Maria Chudnovsky, Ilhee Kim, Gaku Liu, Sergey Norin, Alex Scott, Paul D. Seymour, Stéphan Thomassé
A counterexample to a conjecture of Schwartz. Soc. Choice Welf. 40 (3) (2013)
Jan Hladký, Daniel Král, Sergey Norin
Counting flags in triangle-free digraphs. Electron. Notes Discret. Math. 34 (2009)