Andrea Jim'enez

collaborators

4 papers

math.CO2026

Odd Hadwiger number and graph products

Henry EcheverrÃa, Andrea JimÃ©nez, Suchismita Mishra +2

The Odd Hadwiger number of a graph $G$ is the largest integer $r$ such that $G$ has a clique of size $r$ as an odd minor. In this paper, we investigate how large is the Odd Hadwige…

math.CO2026

Homomorphism counting for immersion-closed classes is not isomorphism

Andrea JimÃ©nez, Benjamin Moore, Daniel A. Quiroz +1

LovÃ¡sz proved that two graphs $G$ and $H$ are isomorphic if $hom (K, G) = hom (K, H)$ for all graphs $K$ , where $hom (G_{1}, G_{2})$ denotes the number of homomorphisms from $G_{1}$ to $G_…

math.CO2025

Totally odd immersions of complete graphs in graph products

For a graph $G$ , let $im (G)$ denote the maximum integer $t$ such that $G$ contains $K_{t}$ as an immersion. A recent paper of Collins, Heenehan, and McDonald (2023) studied the behav…

math.CO2025

Totally odd subdivisions in Kneser graphs

As evidence for the Odd Hadwiger Conjecture, Simonyi and ZsbÃ¡n (2010) showed that every Kneser graph $G$ with large enough order (compared to $I ¨ (G)$ ) contains a totally odd subdi…