Sergey Norin

activity

20062019

most citedOn the Number of Pentagons in Triangle-Free Graphs

166 citations · 387 across the 14 of their papers we have counts for

collaborators

Showing math.COShow all

16 papers · 1 filter

math.CO2019★ 16 cited

Minimal bricks

Serguei Norine, Robin Thomas

A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. A brick is minimal if for every edge e the deletio…

math.CO2017

On the Space of 2-Linkages

Guantao Chen, Serguei Norine, Robin Thomas +1

Let $G = (V, E)$ be a finite undirected graph. If $P$ is an oriented path from $r_{1} \in V$ to $r_{2} \in V$ , we define $\partial (P) = r_{2} - r_{1}$ . If $R, S \subseteq V$ , we denote by $P(G; R,…

math.CO2017

On $2$ -cycles of graphs

Serguei Norine, Robin Thomas, Hein van der Holst

Let $G = (V, E)$ be a finite undirected graph. Orient the edges of $G$ in an arbitrary way. A $2$ -cycle on $G$ is a function $d : E^{2} \to Z$ such for each edge $e$ , $d(e, \cdo…

math.CO2012

The entropy of random-free graphons and properties

Hamed Hatami, Serguei Norine

Every graphon defines a random graph on any given number $n$ of vertices. It was known that the graphon is random-free if and only if the entropy of this random graph is subquadrat…

math.CO2012

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.

math.CO2012★ 7 cited

K_6 minors in 6-connected graphs of bounded tree-width