Return to Question

Is there for every positive integer $n\in\mathbb{N}$ a finite, simple, undirected graph $G=(V,E)$ with $n=\lvert V\rvert$ and 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).

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).

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).

Is there for every positive integer $n\in\mathbb{N}$ a finite, simple, undirected graph $G=(V,E)$ with $n=\lvert V\rvert$ and 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).

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

1. for all $v\in V$ we have $\text{deg}(v) \geq k$, and
2. $G$ does not have a complete minor with more than $\frac{k}{n}$ points.

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).