2 problems

Let $G$ be a graph, let $c(G)$ denote its circumference, and call $G$ $k$-cyclable if every set of $k$ vertices is contained in a cycle. For a given $n$, let $g(n)$ be the largest…

Let $G$ be a graph, let $c(G)$ denote its circumference, and call $G$ $k$-cyclable if every set of $k$ vertices is contained in a cycle. For a given $n$, let $f(n)$ be the largest…