3 papers
math.CO2026
Coloring graphs with independence number two and no odd clique immersions
Henry Echeverría, Jessica McDonald
We study the chromatic number of graphs that exclude a clique as a strong odd immersion and have independence number two. Given a graph and , we prove that if…
math.CO2025
Totally odd subdivisions in Kneser graphs
Henry Echeverría, Andrea Jiménez, Suchismita Mishra +3
As evidence for the Odd Hadwiger Conjecture, Simonyi and Zsbán (2010) showed that every Kneser graph with large enough order (compared to ) contains a totally odd subdivi…
math.CO2025
Totally odd immersions of complete graphs in graph products
Henry Echeverría, Andrea Jiménez, Suchismita Mishra +2
For a graph , let denote the maximum integer such that contains as an immersion. A recent paper of Collins, Heenehan, and McDonald (2023) studied the behav…