Kevin Lieber of Vsauce2 examines how basic matchstick puzzles help solve complex graph theory problems.

Extremal graph theory seeks the largest or smallest structure a graph can exhibit under given constraints, typically by forbidding a particular subgraph. The classical Turán problem determines the ...

Graph theory examines mathematical structures in which objects are represented as vertices connected by edges. It provides the language and tools to model networks in computer science, biology, social ...

Like many of us, [Tim]’s seen online videos of circuit sculptures containing illuminated LED filaments. Unlike most of us, however, he went a step further by using graph theory to design glowing ...

On March 15, intriguing seminar announcements sent rumblings through the field of combinatorics, the mathematical study of counting. Three collaborators planned to give coordinated talks the following ...