Maximum matching in a hamilton graph of "k" vertices is always (k+1)/2 , is this claim correct?

64 Views Asked by At

My observation is : - Say for a(any) Hamilton graph of 1000 vertices , the value of its maximum matching will be 500 .

Can somebody prove it or verify it ?