Joseph Zaks conjectures in [1] g(n)>f(n)n≥3.The paper proves the conjecture true.meat as following:
Theorem 6. f(2k)=2k[f(2k-2)+f(2k-4)] k≥3.
Lemma 1. if G is 2k+1-conneted graph(k≥1),G has no 1-factor,
tehn |M(G)|≥(2k+1)!!+1.
Theorem 7. g(2k+1)>f(2k+1)
Lemma 2.f(2k-1)≥2kf(2k-4)
Theorem 8. g(2k)>f(2k)
Theorem 9. g(n)>f(n)