Sergey Norin

activity

20232026

most citedTwin-width of sparse random graphs

2 citations · 2 across the 6 of their papers we have counts for

collaborators

Showing 2025Show all

2 papers · 1 filter

math.CO2025

Small hitting sets for longest paths and cycles

Sergey Norin, Raphael Steiner, Stephan Thomassé +1

Motivated by an old question of Gallai (1966) on the intersection of longest paths in a graph and the well-known conjectures of Lovász (1969) and Thomassen (1978) on the maximum le…

math.CO2025

Defective coloring of blowups

Sergey Norin, Raphael Steiner

Given a graph $G$ and an integer $d \geq 0$ , its $d$ -defective chromatic number $χ^{d} (G)$ is the smallest size of a partition of the vertices into parts inducing subgraphs with maximu…