Sergey Norin

According to our database1, Sergey Norin authored at least 25 papers between 2009 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
A Lower Bound on the Average Degree Forcing a Minor.
Electron. J. Comb., 2020

2019
List coloring with requests.
Journal of 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


  Loading...