Name
Abstract | ||
|---|---|---|
An extension of Hall's theorem is proved, which gives a condition for complete matchings in a certain class of hypergraphs. |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1007/BF01793010 | Graphs and Combinatorics |
Keywords | Field | DocType |
Complete Matchings | Discrete mathematics,Topology,Combinatorics,Constraint graph,Mathematics | Journal |
Volume | Issue | ISSN |
11 | 3 | 1435-5914 |
Citations | PageRank | References |
27 | 3.02 | 3 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| P. E. Haxell | 1 | 212 | 26.40 |