Name
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 n2. We prove that under this condition H must have a perfect matching. This answers a question of Kuhn and Osthus. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.ejc.2008.02.011 | Eur. J. Comb. |
Keywords | DocType | Volume |
r-partite r-graphs,perfect matchings,following condition,r-partite r-graph,perfect matching,size n,condition h,satisfiability | Journal | 30 |
Issue | ISSN | Citations |
1 | European Journal of Combinatorics 30 (2009), 39-42 | 17 |
PageRank | References | Authors |
1.47 | 4 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ron Aharoni | 1 | 380 | 66.56 |
| Agelos Georgakopoulos | 2 | 66 | 12.05 |
| Philipp Sprüssel | 3 | 46 | 8.52 |