Let $G$ be a graph with $2 n + 1$ vertices and $n^{2} + n + 1$ edges. Must $G$ contain two vertices of the same degree which are joined by a path of length $3$ ?

Worked, still open.

graph theory · solved · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239

vela reproduce examples/erdos-problems

links

solved