4 papers
Odd Hadwiger number and graph products
Henry Echeverría, Andrea Jiménez, Suchismita Mishra +2
The Odd Hadwiger number of a graph is the largest integer such that has a clique of size as an odd minor. In this paper, we investigate how large is the Odd Hadwige…
Immersions of large cliques in graphs with independence number 2 and bounded maximum degree
Fábio Botler, Cristina G. Fernandes, Carla N. Lintzmayer +4
An immersion of a graph in a graph is a minimal subgraph of for which there is an injection and a set of edge-disjoint paths $\{P_e:…
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…
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…