A quantitative approach to perfect one-factorizations of complete bipartite graphs
Author
dc.contributor.author
Astromujoff, Natacha
Author
dc.contributor.author
Matamala Vásquez, Martín
Admission date
dc.date.accessioned
2015-08-17T20:25:01Z
Available date
dc.date.available
2015-08-17T20:25:01Z
Publication date
dc.date.issued
2015
Cita de ítem
dc.identifier.citation
The electronic journal of combinatorics 22 (1) (2015), #P1.72
en_US
Identifier
dc.identifier.uri
https://repositorio.uchile.cl/handle/2250/132801
General note
dc.description
Artículo de publicación ISI
en_US
Abstract
dc.description.abstract
Given a one-factorization F of the complete bipartite graph Kn;n, let pf(F) de-
note the number of Hamiltonian cycles obtained by taking pairwise unions of perfect
matchings in F. Let pf(n) be the maximum of pf(F) over all one-factorizations F
of Kn;n. In this work we prove that pf(n) > n2=4, for all n > 2.
en_US
Patrocinador
dc.description.sponsorship
Program Basal-CMM
Nucleo Milenio Informacion y Coordinacion en Redes
ICM/FIC RC130003