 | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
A proof needs to be added. Jamie King 18:50, 13 September 2007 (UTC)
The part about finding a set U does not seem to work for any hypo-matchable graphs (tried for K_3, C_5 among others). 16:04, 16 January 2019 (UTC)