Back to Search
Start Over
Perfect matchings in -partite -graphs
- Source :
-
European Journal of Combinatorics . Jan2009, Vol. 30 Issue 1, p39-42. 4p. - Publication Year :
- 2009
-
Abstract
- Abstract: Let be an -partite -graph, all of whose sides have the same size . Suppose that there exist two sides of , each satisfying the following condition: the degree of each legal -tuple contained in the complement of this side is strictly larger than . We prove that under this condition must have a perfect matching. This answers a question of Kühn and Osthus. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 01956698
- Volume :
- 30
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- European Journal of Combinatorics
- Publication Type :
- Academic Journal
- Accession number :
- 34954429
- Full Text :
- https://doi.org/10.1016/j.ejc.2008.02.011