Calendar

Posted February 26, 2026

LSU SIAM Student Chapter

Harbir Antil, George Mason University
Malena Espanol, Arizona State University
A Lunch with SCALA Speakers

A lunch and informal discussion providing an opportunity to ask questions before SCALA.

Posted September 3, 2025
Last modified January 14, 2026

Conference

Scientific Computing Around Louisiana (SCALA) 2026

http://www.cct.lsu.edu/SCALA2026

Posted February 26, 2026

Combinatorics Seminar Questions or comments?

Zi-Xia Song, University of Central Florida
Dominating Hadwiger's Conjecture

A dominating $K_t$ minor in a graph $G$ is a sequence $(T_1,\cdots,T_t)$ of pairwise disjoint non-empty connected subgraphs of $G$, such that for $1 \leq i < j \leq t$, every vertex in $T_j$ has a neighbor in $T_i$. Replacing "every vertex in $T_j$" by "some vertex in $T_j$" retrieves the standard definition of a $K_t$ minor. The strengthened notion was introduced in 2024 by Illingworth and Wood, who asked whether every graph with chromatic number $t$ contains a dominating $K_t$ minor. This is a substantial strengthening of the celebrated Hadwiger's Conjecture, which asserts that every graph with chromatic number $t$ contains a $K_t$ minor. Sergey Norin referred to this question as the "Dominating Hadwiger's Conjecture" and believes it is likely false. In this talk, we present our recent work on the Dominating Hadwiger's Conjecture and discuss the key ideas of our results. Joint work with Michael Scully and Thomas Tibbetts.