Counting selfloops, the graph is regular it is the union of a cycle over and of a matching over the vertices the vertices , , have a selfloop each. 각각의 , 에 대해 그래프가 적어도 가장자리 확장을 갖는 상수가 있습니다. Unfortunately, no elementary proof of this fact is known.