Edge condition for long cycles in bipartite graphsReportar como inadecuado

Edge condition for long cycles in bipartite graphs - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

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

Autor: Lech Adamus -

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


Documentos relacionados