girth

• unknown
  • average distance $k$ upper bounds girth by $f(k)$
  • graph class bipartite has unbounded girth
  • graph class forest has unbounded girth
  • graph class disjoint cycles has unbounded girth
  • graph class planar has unbounded girth
  • graph class cycle has unbounded girth
• SchroderThesis
  • page 21 : bounded maximum leaf number does not imply bounded girth – Proposition 3.14
• https://en.wikipedia.org/wiki/Girth_(graph_theory)
  • girth – In graph theory, the girth of an undirected graph is the length of a shortest cycle contained in the graph.