Abstract

Given a constant integer d ? 1 and a host graph H that is sufficiently dense, we lower bound the number of d-factors H contains. When the complement of H is sufficiently sparse, we provide an algorithm that uniformly generates the d-factors of H and we justify the efficiency of the algorithm.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call