2 papers
math.CO2026
Forbidding anticomplete planar minors: Induced Erdős--Pósa property and Maximum Independent Set in QP
Maria Chudnovsky, Amadeus Reinald, Stéphan Thomassé
The Erdős--Pósa theorem asserts that every graph with no disjoint cycles contains a set of vertices such that has no cycle. Robertson and Seymour…
math.CO2026
Coarse Balanced Separators in Biclique-Induced-Minor-Free Graphs
Maria Chudnovsky, Julien Codsi, Claire Kaneshiro
It is a classical theorem of Robertson and Seymour (1986) that the treewidth of a graph is linearly related to its separation number: the smallest integer such that, for every…