Skip to main content
4 of 4
Rollback to Revision 2 - Edit approval overridden by post owner or moderator

Complete minors and minimal degree

Is there for every positive integer $n\in\mathbb{N}$ a finite, simple, undirected graph $G=(V,E)$ with the following property?

$G$ does not have a complete minor with more than $\frac{\delta(G)}{n}$ points (where $\delta(G)$ denotes the minimal degree).