Sergey Norin

Sergey Norin won three International Mathematical Olympiad gold medals for Russia.

Sergey Norin: The Quiet Architect of Modern Graph Theory

In November 2018, the University of Waterloo handed its Tutte Distinguished Lecture podium to a McGill professor who had spent a decade turning a ten-year-old idea called flag algebras into one of the sharpest tools in extremal combinatorics. Sergey Norin's career reads less like a prodigy's origin story and more like a craftsman's ledger of hard problems chipped away, one collaboration at a time.

A Detour Through Wall Street

Norin's path to a McGill professorship was not a straight academic line. After finishing his doctorate, he spent a year as a quantitative analyst at the hedge fund D. E. Shaw & Co., trading the language of graphs and inequalities for the language of markets. He returned to mathematics as a visiting assistant professor at Georgia Tech, then spent four years as an instructor and assistant professor at Princeton before settling at McGill University's Department of Mathematics and Statistics, where he is now an associate professor. The detour matters less as biography than as evidence of a mind comfortable moving between abstract structure and applied optimization — the same instinct that shows up in his research.

The Georgia Tech Apprenticeship

Norin earned his PhD in 2005 from the Georgia Institute of Technology's Algorithms, Combinatorics and Optimization program, supervised by Robin Thomas, one of the field's most influential graph theorists. That apprenticeship placed him inside a lineage obsessed with the structure of graphs — how large, complicated networks can be decomposed, colored, or forced into contradictions. It is a lineage that runs through some of the deepest open problems in mathematics, including the Hadwiger conjecture on graph coloring, a problem Norin has spent much of his career circling.

Flag Algebras and the Ten-Year Verdict

Norin's own description of his work is characteristically understated: his research sits in "graph theory, combinatorics and their applications," concentrated on extremal and structural graph theory. But the substance is more dramatic than the phrasing suggests. Since 2007, a technique called flag algebras — developed by Alexander Razborov — had offered a way to encode delicate combinatorial arguments in a form that could, in some cases, be computerized. By 2018, Norin was one of the researchers best positioned to take stock of what the method had actually delivered: adoption across more than a hundred papers, partial progress on the long-standing Caccetta–Häggkvist conjecture, and inroads into an Erdős conjecture about partitioning triangle-free graphs. Working with collaborators including Daniel Kráľ, Hamed Hatami, and Jan Hladký, Norin helped turn a promising computational trick into a working toolkit against problems that had resisted direct attack for decades.

Building a School at McGill

Since joining McGill, Norin has supervised a stream of PhD and master's students who have gone on to positions at Oxford University, Emory University, and Google — a quieter but consequential form of mathematical influence, measured in students placed rather than headlines won. He has also become a fixture of the field's social infrastructure: since 2018 he has co-organized the Barbados Graph Theory workshops alongside Paul Seymour and David Wood, gatherings that function as informal incubators for the discipline's next results.

Why Sergey Is Called a Genius

The available record does not show anyone calling Sergey Norin a genius, and that absence is itself informative. His reputation, as far as it can be reconstructed from his own research statements and the institutions that have hosted him, rests on a narrower and more verifiable claim: technical command of an unusually difficult corner of combinatorics, sustained over two decades, and the judgment to know which computational shortcuts — like flag algebras — are worth building a career around rather than treating as a novelty. That is a different kind of achievement than the flash of insight associated with "genius" in its popular sense. It looks more like disciplined craft: apprenticing under a master (Robin Thomas), testing ideas against real money at a hedge fund, then returning to spend years grinding on conjectures that have humbled generations of mathematicians. If there is brilliance here, the sources suggest it is the unglamorous kind — pattern recognition compounded by persistence, not a single dazzling proof.

A Career Still Being Written

Norin's legacy, at least the part visible in the public record, is still a working one: a growing list of students now embedded in mathematics and industry, a body of work that has helped rehabilitate flag algebras as a serious method, and a continuing role co-hosting the field's most storied informal workshop. It is the legacy of an institution-builder as much as a theorem-prover — the kind of career that shapes a field from inside its seminar rooms rather than from its headlines.

Compare with the greats

Enrico Fermi vs SocratesKim Ung Yong vs Thomas AquinasPlato vs PythagorasAdam Smith vs Gottfried Wilhelm Leibniz
See the IQ Rankings →All comparisons →

Child prodigies

Sky BrownSky BrownWon Olympic park bronze at 13, Britain's youngest medalist everKit ArmstrongKit ArmstrongA full-time university student at nine, called the greatest…Arisa TrewArisa TrewFirst woman to land a 720, then Olympic park gold at age 14Monica SelesMonica SelesTeenage world No. 1 who won eight Grand Slam titles before…
Child prodigies →

Play & come back tomorrow

Daily Genius Challenge · Guess the genius
19th-century mathematician who wrote the first algorithm for Charles Babbage's Analytical Engine.
Tap your answer ↓
Which Genius Are You? Free IQ Test