# Even maps, the Colin de~Verdi\`ere number and representations of graphs

## TL;DR

This paper proves the conjecture that the graph parameter  (sigma) bounds the Colin de Verdire number  (mu) from above, establishing a new topological upper bound that is tight in some cases and exploring the gap between these parameters.

## Contribution

The paper confirms the conjecture (G) \u2264 (G) and demonstrates the existence of graphs where the gap between  and  is small and large, providing new insights into their relationship.

## Key findings

- Confirmed (G) \u2264 (G) conjecture.
- Constructed graphs with small and large gaps between  and .
- Established bounds for incidence graphs of finite projective planes.

## Abstract

Van der Holst and Pendavingh introduced a graph parameter $\sigma$, which coincides with the more famous Colin de Verdi\`{e}re graph parameter $\mu$ for small values. However, the definition of $\sigma$ is much more geometric/topological directly reflecting embeddability properties of the graph. They proved $\mu(G) \leq \sigma(G) + 2$ and conjectured $\mu(G) \leq \sigma(G)$ for any graph $G$. We confirm this conjecture. As far as we know, this is the first topological upper bound on $\mu(G)$ which is, in general, tight. Equality between $\mu$ and $\sigma$ does not hold in general as van der Holst and Pendavingh showed that there is a graph $G$ with $\mu(G) \leq 18$ and $\sigma(G)\geq 20$. We show that the gap appears on much smaller values, namely, we exhibit a graph $H$ for which $\mu(H)\leq 7$ and $\sigma(H)\geq 8$. We also prove that, in general, the gap can be large: The incidence graphs $H_q$ of finite projective planes of order $q$ satisfy $\mu(H_q) \in O(q^{3/2})$ and $\sigma(H_q) \geq q^2$.