Edge condition for long cycles in bipartite graphsReport as inadecuate




Edge condition for long cycles in bipartite graphs - Download this document for free, or read online. Document in PDF available to download.

1 Institute of Mathematics Krakow

Abstract : The following problem was solved by Woodall in 1972: for any pair of nonnegative integers n and k < n-2 - 1 find the minimum integer gn, k such that every graph with n vertices and at least gn, k edges contains a cycle of length n - k. Woodall proved even more: the size gn, k, in fact, guarantees the existence of cycles C, for all 3



Author: Lech Adamus -

Source: https://hal.archives-ouvertes.fr/



DOWNLOAD PDF




Related documents