2 papers
math.CO2025
Polynomial extensions of Raimi's theorem
Norbert Hegyvari, Janos Pach, Thang Pham
Raimi's theorem guarantees the existence of a partition of into two parts with an unavoidable intersection property: for any finite coloring of , some colo…
math.CO2025
Immersions and Albertson's conjecture
Jacob Fox, Janos Pach, Andrew Suk
A graph is said to contain (a clique of size ) as a weak immersion if it has vertices, pairwise connected by edge-disjoint paths. In 1989, Lescure and Meyniel made the…