A quantitative approach to perfect one-factorizations of complete bipartite graphs
Artículo
A-quantitative-approach-to-perfect-one-factorizations.pdf (258.3Kb)Publication date
2015Metadata
Show full item record
Cómo citar
Cómo citar
A quantitative approach to perfect one-factorizations of complete bipartite graphs
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.
General note
Artículo de publicación ISI
Patrocinador
Program Basal-CMM
Nucleo Milenio Informacion y Coordinacion en Redes
ICM/FIC RC130003
Identifier
URI: https://repositorio.uchile.cl/handle/2250/132801
Quote Item
The electronic journal of combinatorics 22 (1) (2015), #P1.72
Collections
The following license files are associated with this item:
Except where otherwise noted, this item's license is described as Atribución-NoComercial-SinDerivadas 3.0 Chile