Minors in graphs of large ${\theta }_r$-girth

Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau +1

For every $r\in \mathbb{N}$, let ${\theta }_r$ denote the graph with two vertices and $r$ parallel edges. The ${\theta }_r$-girth of a graph $G$ is the minimum number of edges of a subgraph of $G…