The Library
Perfect matchings in -partite -graphs
Tools
Tools
Tools
Aharoni, Ron, Georgakopoulos, Agelos and Sprüssel, Philipp (2009) Perfect matchings in -partite -graphs. European Journal of Combinatorics, Vol.30 (No.1). pp. 39-42. doi:10.1016/j.ejc.2008.02.011
Research output not available from this repository, contact author.
Official URL: http://dx.doi.org/10.1016/j.ejc.2008.02.011
Abstract
Let H be an r-partite r-graph, all of whose sides have the same size n. Suppose that there exist two sides of H, each satisfying the following condition: the degree of each legal r−1-tuple contained in the complement of this side is strictly larger than . We prove that under this condition H must have a perfect matching. This answers a question of Kühn and Osthus.
| Item Type: | Journal Article | ||||
|---|---|---|---|---|---|
| Divisions: | Faculty of Science > Mathematics | ||||
| Journal or Publication Title: | European Journal of Combinatorics | ||||
| Publisher: | Academic Press | ||||
| ISSN: | 0195-6698 | ||||
| Official Date: | 2009 | ||||
| Dates: |
|
||||
| Volume: | Vol.30 | ||||
| Number: | No.1 | ||||
| Page Range: | pp. 39-42 | ||||
| DOI: | 10.1016/j.ejc.2008.02.011 | ||||
| Status: | Peer Reviewed | ||||
| Publication Status: | Published | ||||
| Access rights to Published version: | Restricted or Subscription Access |
Request changes or add full text files to a record
Repository staff actions (login required)
 |
View Item |
