2 papers
math.CO2026
Every graph with no minor is 6-colorable
Zdeněk Dvořák, Sergey Norin, Neil Rahman
The first open case of Hadwiger's conjecture states that every -minor-free graph is 6-colorable. We prove that this is the case for -minor-free graphs, where de…
cs.GT2026
Random Serial Dictatorship is -Envy-Free
Frank Connor, Max Dupré la Tour, Louis-Roy Langevin +4
We analyze the house allocation problem, in which a set of agents must be matched to a set of objects for which they have cardinal utilities. A central mechanism for this problem i…