Talk:Partition matroid
In the definition section, the article says : "A basis of the matroid is a set whose intersection with every block B_i has size exactly d_i."
 | This article is rated C-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
In the definition section, the article says : "A basis of the matroid is a set whose intersection with every block B_i has size exactly d_i."
Is really the size required to be *exactly* d_i, or rather at most d_i (with extra constraints on global maximality). For example for the Max Matching problem, a bipartite graph might be such that some vertices have degree 0 (and thus no selectable edges), while the problem is formulated in terms of matroid intersection with d_i=1. Or am I missing something?
Acasteigts (talk) 14:17, 12 November 2017 (UTC)
- Bipartite maximum matching is a matroid intersection problem where you're trying to find a largest set that's independent in two matroids. It is not necessarily a basis in either of them. The exactness condition is only for bases, not for independent sets, as it says. —David Eppstein (talk) 17:06, 12 November 2017 (UTC)
Content Disclaimer
Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.
- The information displayed on this website is sourced in part or in whole from Wikipedia and has been adapted for the purpose of restating it. We strive to provide accurate and relevant information, however:
- There is no guarantee of absolute accuracy. Wikipedia is an open, collaborative project that can be edited by anyone, so information is subject to change.
- It is not intended to constitute professional advice. The content displayed is for informational and educational purposes only. For important decisions (e.g., medical, legal, or financial), please consult a professional.
- Content copyright. Wikipedia is licensed under the Creative Commons Attribution-ShareAlike License (CC BY-SA). This means that content may be reused with appropriate attribution and shared under a similar license.
- Responsible use. Any risk arising from the use of information from this website is entirely the responsibility of the user.