On June 2, 2026, Maria Chudnovsky from Princeton University gave a talk on bounding treewidth of n-vertex graphs excluding fixed induced minors as a function of n at the Discrete Math Seminar. The title of her talk was "Induced minors and treewidth". https://t.co/LbH0EWyZP1
On May 26, 2026, Fernanda Rivera Omaña from the University of Waterloo gave a talk at the Discrete Math Seminar on the Erdős-Pósa property for matroid minors. The title of her talk was "Erdős-Pósa theorem for matroids".
https://t.co/E29SkZXKGJ
#New_published_paper
Archontia C. Giannopoulou and *Sebastian Wiederrecht*,
Two disjoint alternating paths in bipartite graphs: conformal crosses,
Combinatorica, 46:19, May 2026.
https://t.co/SsyI5499FK
On May 19, 2026, Xavier Goaoc from Université de Lorraine gave a talk at the Discrete Math Seminar on a tree decomposition of the chirotopes of a planar point set and its application to counting triangulations of a chirotope.
https://t.co/JDXmkqrc5l
The IBS Discrete Mathematics Group welcomes Arnaud Patey, a new graduate student of the Discrete Mathematics Group from May 18, 2026 to July 17, 2026. He is a MS student at ENS Rennes. https://t.co/aKNb602v2l
#New_arXiv_paper
Dario Cavallaro, *Maximilian Gorsky*, Stephan Kreutzer, Dimitrios M. Thilikos, and Sebastian Wiederrecht,
Optimal Bounds for the k-Disjoint Paths Problem, 2026.
https://t.co/55BI6PNPXg
#New_arXiv_paper
*Mujin Choi*, Tuukka Korhonen, and *Sang-il Oum*,
Branch-width of represented matroids in matrix multiplication time, 2026.
https://t.co/8HyRsMEgGC
On May 12, 2026, Benjamin Duhamel from ENS de Lyon gave a talk at the Discrete Math Seminar on characterizing forests F such that forbidding a biclique and an induced minor isomorphic to F implies bounded path-width.
“Excluding a forest induced minor“. https://t.co/9PuOgsqKjD
#New_arXiv_paper
*Maximilian Gorsky*, Kevin Hendrey, and *Tony Huynh*,
The Erdős-Pósa property for prime-length cycles fails (and beyond), 2026.
https://t.co/H008Werwdy
#New_accepted_paper
Katie Clinch, Dániel Garamvölgyi, John Haslegrave, Tony Huynh, Jan Legerský, and Anthony Nixon,
Stable cuts, NAC-colourings and flexible realisations of graphs,
J. Graph Theory, accepted, 2026.
https://t.co/U3YCkwxJSN
On May 6, 2026, Maximilian Gorsky from @ibsdimag
gave a talk at the Discrete Math Seminar on a new algorithm for k-disjoint paths problem with an explicit running time. "The Disjoint Paths Problem lies in the Oort cloud of algorithms"
https://t.co/CmvzVeG50B
On April 28, 2026, Xin Wei (魏歆) from the IBS Extremal Combinatorics and Probability Group gave a talk at the Discrete Math Seminar on the maximum size of a t-perfect hash family over an alphabet of size q. “Separating hash families with large universe"
https://t.co/fDUdcmfSDA
#New_arXiv_paper
*Andreas Holmsen*, Attila Jung, Balázs Keszegh, Dániel G. Simon, and Gábor Tardos,
Piercing all maximum cliques in hypergraphs, 2026.
https://t.co/ZHSwCSC3yE
#New_accepted_conference_paper
*Colin Geniet*, Fatemeh Ghasemi, and Mamadou Moustapha Kanté,
Transducing Linear Decompositions of Tournaments,
In the Proceedings of ICALP 2026 (Royal Holloway, University of London. London, UK, July 7-10), accepted, 2026.
https://t.co/IFa7BEqlFr
#New_accepted_conference_paper
Édouard Bonnet, *Colin Geniet*, *Eun Jung Kim*, and Sungmin Moon,
Fast shortest path in graphs with sparse signed tree models and applications,
ICALP 2026 (London, UK, July 7-10), accepted, 2026.
https://t.co/CgxT8jkisY