3 papers
math.CO2025
Odd complete bipartite minors in graphs with independence number two
Rong Chen, Zijian Deng
Recently, Chen and Deng have proved that every graph with independence number two contains as a minor for each integer with . In…
math.CO2024
A simple proof of the existence of complete bipartite graph immersion in graphs with independence number two
Rong Chen, Zijian Deng
Hadwiger's conjecture for the immersion relation posits that every graph contains an immersion of the complete graph . Vergara showed that this is equivalent to sayin…
math.CO2024
Connected matching in graphs with independence number two
Rong Chen, Zijian Deng
A matching in a graph is {\em connected} if has an edge linking each pair of edges in . The problem to find large connected matchings in graphs with is…