Sergey Norin

activity

20242026

collaborators

4 papers

math.CO2026

Disproof of the tree product conjecture via the Heisenberg group

Freddie Illingworth, Sergey Norin, Raphael Steiner

Product structure theory aims to understand complex graphs by embedding them into products of simpler graphs. In this direction, Campbell, Distel, Gollin, Harvey, Hendrey, Hickingb…

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 l…

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 $I ¨ ^{d} (G)$ is the smallest size of a partition of the vertices into parts inducing subgraphs with maxim…

math.CO2024

Strong parity edge-colorings of graphs

Peter Bradshaw, Sergey Norin, Douglas B. West

An edge-coloring of a graph $G$ assigns a color to each edge of $G$ . An edge-coloring is a parity edge-coloring if for each path $P$ in $G$ , it uses some color on an odd number of…