 Shortness exponent

In graph theory, the shortness exponent is a numerical parameter of a family of graphs that measures how far from Hamiltonian the graphs in the family can be.Intuitively, if formula_1 is the shortness exponent of a graph family formula_2, then every formula_3-vertex graph in the family has a cycle of length near formula_4 but some graphs do not have longer cycles.