A note on pancyclism of highly connected graphs Original Research Article

Jackson and Ordaz conjectured that if the stability number α(G) of a graph G is no greater than its connectivity κ(G) then G is pancyclic. Applying Ramseyʹs theorem we prove the pancyclicity of every graph G with κ(G) sufficiently large with respect to α(G).