One platform for all researcher needs
AI-powered academic writing assistant
Your #1 AI companion for literature search
AI tool for graphics, illustrations, and artwork
Unlock unlimited use of all AI tools with the Editage Plus membership.
Explore Editage Plus
Audio Papers
Ask R Discovery
Translation
Auto-sync
Collaboration
Open Accesshttps://doi.org/10.1016/j.ejc.2009.11.008
Copy DOI
Export
Save
Share
Cite Journal: European Journal of Combinatorics |  Publication Date: Dec 4, 2009 |
 Citations: 6 |  License type: publisher-specific-oa |
We show that every cubic bridgeless graph with n vertices has at least 3 n / 4 − 10 perfect matchings. This is the first bound that differs by more than a constant from the maximal dimension of the perfect matching polytope.
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
