Let $G$ be a graph with $1 + n (m - 1)$ vertices and $1 + n (2 m)$ edges. Must $G$ contain two points which are connected by $m$ disjoint paths?

Worked, still open.

graph theory · solved · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239

vela reproduce examples/erdos-problems

links

solved