Vertex-disjoint cycles in bipartite tournaments

Consultar RECERCAT

Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/2117/111583

Título:	Vertex-disjoint cycles in bipartite tournaments
Autor/a:	González Moreno, Diego; Balbuena Martínez, Maria Camino Teófila; Olsen, Mika
Otros autores:	Universitat Politècnica de Catalunya. Departament d'Enginyeria Civil i Ambiental; Universitat Politècnica de Catalunya. COMPTHE - Combinatòria i Teoria Discreta del Potencial pel control de paràmetres en xarxes
Abstract:	Let k=2 be an integer. Bermond and Thomassen conjectured that every digraph with minimum out-degree at least 2k-1 contains k vertex-disjoint cycles. Recently Bai, Li and Li proved this conjecture for bipartite digraphs. In this paper we prove that every bipartite tournament with minimum out-degree at least 2k-2, minimum in-degree at least 1 and partite sets of cardinality at least 2k contains k vertex-disjoint 4-cycles whenever k=3. Finally, we show that every bipartite tournament with minimum degree d=min(d+,d-) at least 1.5k-1 contains at least k vertex-disjoint 4-cycles.
Abstract:	Peer Reviewed
Materia(s):	-Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta -Bipartite graphs -Bermond-Thomassen conjecture -Bipartite tournament -Minimum outdegree -Prescribed length -Vertex-disjoint cycles -Grafs, Teoria de
Derechos:	Attribution-NonCommercial-NoDerivs 3.0 Spain http://creativecommons.org/licenses/by-nc-nd/3.0/es/
Tipo de documento:	Artículo - Versión presentada Artículo
Compartir: