Graph TheoryChallengePlanar Graphs
Planar Graphs · Challenge problem
Let be the graph on vertices forming the -cycle () together with the two chords and . Using 's girth in the general edge bound , what is the largest possible integer value of for a connected simple PLANAR graph on vertices with the same girth as ?