Two (Known) Results About Graphs with No Short Odd Cycles

Sariel Har-Peled, Saladi Rahul

Consider a graph with $n$ vertices where the shortest odd cycle is of length $>2k+1$. We revisit two known results about such graphs: (I) Such a graph is almost bipartite, in the s…