According to our database
1,
Sergey Norin
authored at least 46 papers
between 2009 and 2024.
Collaborative distances:
2024
Cops and Robbers on \(\boldsymbol{P_5}\)-Free Graphs.
SIAM J. Discret. Math., March, 2024
2023
The Spectrum of Triangle-Free Graphs.
SIAM J. Discret. Math., June, 2023
Clustered colouring of graph classes with bounded treedepth or pathwidth.
Comb. Probab. Comput., January, 2023
Connectivity and choosability of graphs with no <i>K</i><sub><i>t</i></sub> minor.
J. Comb. Theory, Ser. B, 2023
J. Comb. Theory, Ser. B, 2023
Every graph is eventually Turán-good.
J. Comb. Theory, Ser. B, 2023
Twin-width of sparse random graphs.
CoRR, 2023
Cops and robbers on P<sub>5</sub>-free graphs.
CoRR, 2023
Crossing numbers of complete bipartite graphs.
Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023
2022
Counterexamples to a Conjecture of Harris on Hall Ratio.
SIAM J. Discret. Math., 2022
Obstructions for partitioning into forests and outerplanar graphs.
Discret. Appl. Math., 2022
The Burning Number Conjecture Holds Asymptotically.
CoRR, 2022
Three-dimensional graph products with unbounded stack-number.
CoRR, 2022
A New Upper Bound on the Chromatic Number of Graphs with No Odd K<sub>t</sub> Minor.
Comb., 2022
Non-Bipartite K-Common Graphs.
Comb., 2022
Testability and Local Certification of Monotone Properties in Minor-Closed Classes.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022
2021
Sublinear Separators in Intersection Graphs of Convex Shapes.
SIAM J. Discret. Math., 2021
Asymptotic density of graphs excluding disconnected minors.
J. Comb. Theory, Ser. B, 2021
Bounding the number of cycles in a graph in terms of its degree sequence.
Eur. J. Comb., 2021
The Smallest Matroids with no Large Independent Flat.
Electron. J. Comb., 2021
Descending the Stable Matching Lattice: How Many Strategic Agents Are Required to Turn Pessimality to Optimality?
Proceedings of the Algorithmic Game Theory - 14th International Symposium, 2021
2020
A Lower Bound on the Average Degree Forcing a Minor.
Electron. J. Comb., 2020
2019
List coloring with requests.
J. Graph Theory, 2019
A bound on the inducibility of cycles.
J. Comb. Theory, Ser. A, 2019
Treewidth of graphs with balanced separations.
J. Comb. Theory, Ser. B, 2019
A Turán Theorem for Extensions Via an Erdős-Ko-Rado Theorem for Lagrangians.
Comb., 2019
Clustered Colouring in Minor-Closed Classes.
Comb., 2019
2018
Corrigendum: Orthogonal Tree Decompositions of Graphs.
SIAM J. Discret. Math., 2018
Orthogonal Tree Decompositions of Graphs.
SIAM J. Discret. Math., 2018
Turán numbers of extensions.
J. Comb. Theory, Ser. A, 2018
Distribution of Coefficients of Rank Polynomials for Random Sparse Graphs.
Electron. J. Comb., 2018
Treewidth of Grid Subsets.
Comb., 2018
2017
Turán number of generalized triangles.
J. Comb. Theory, Ser. A, 2017
The extremal function for disconnected minors.
J. Comb. Theory, Ser. B, 2017
2016
Strongly Sublinear Separators and Polynomial Expansion.
SIAM J. Discret. Math., 2016
Non-planar extensions of subdivisions of planar graphs.
J. Comb. Theory, Ser. B, 2016
Flag algebras and the stable coefficients of the Jones polynomial.
Eur. J. Comb., 2016
Erdős-Szekeres Without Induction.
Discret. Comput. Geom., 2016
2015
Excluding a Substar and an Antisubstar.
SIAM J. Discret. Math., 2015
Large Supports are Required for Well-Supported Nash Equilibria.
Proceedings of the Approximation, 2015
New tools and results in graph minor structure theory.
Proceedings of the Surveys in Combinatorics 2015, 2015
2014
A Near-Optimal Mechanism for Impartial Selection.
Proceedings of the Web and Internet Economics - 10th International Conference, 2014
2013
A counterexample to a conjecture of Schwartz.
Soc. Choice Welf., 2013
Sparse halves in dense triangle-free graphs.
Electron. Notes Discret. Math., 2013
Polylogarithmic Supports Are Required for Approximate Well-Supported Nash Equilibria below 2/3.
Proceedings of the Web and Internet Economics - 9th International Conference, 2013
2009
Counting flags in triangle-free digraphs.
Electron. Notes Discret. Math., 2009
