theorem WrittenOnTheWallII.GraphConjecture34.conjecture34 {α : Type u_1} [Fintype α] [DecidableEq α] [Nonempty α] (G : SimpleGraph α) (h_conn : G.Connected) : ⌈G.distavg G.graphCenter + G.distavg G.maxEccentricityVertices⌉ ≤ ↑G.path

WOWII Conjecture 34

Let path(G) be the floor of the average distance of a connected graph G. Then path(G) ≥ ceil( distavg(G, center) + distavg(G, maxEccentricityVertices G) ).