Strongly maximal matchings and strongly minimal covers
Ron Aharoni
TL;DR
This paper discusses the concepts of strongly maximal matchings and strongly minimal covers, providing a summary of key ideas and stating the main conjecture in this area of graph theory.
Contribution
It offers a comprehensive summary of the main ideas related to strongly maximal matchings and strongly minimal covers, including the main conjecture in the field.
Findings
Summarizes key concepts in strongly maximal matchings.
States the main conjecture in the field.
Serves as a reference for future research.
Abstract
This is a not-to-be-journal-published paper, aimed to serve as reference. It is a summary of the main ideas on the topic appearing in the title, and an opportunity to state correctly the main conjecture in the field.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNonlinear Partial Differential Equations · Advanced Harmonic Analysis Research · Geometric and Algebraic Topology