A minimal cut of a graph is a minimal set of vertices whose removal disconnects the graph. Let $c (n)$ be the maximum number of minimal cuts a graph on $n$ vertices can have. Does $c (n)^{1/ n} \to α$ for some $α < 2$ ?

Worked, still open.

graph theory · solved · possible · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239

vela reproduce examples/erdos-problems

links

solved