Matchings
From Egres Open
This page will contain a survey of open problems related to matchings.
Problems in this category:
- Changing conservative weightings in bipartite graphs
- Characterization of dual-critical graphs
- Compactness of Kőnig-property
- Deciding the existence of popular matchings
- Edge-covering number of 2-polymatroids
- Exact matching in red-blue bipartite graphs
- Graphs extendable to a uniquely matchable bipartite graph
- Maximum size of a source-sink reorientable set
- Maximum square-free 2-matching
- Maximum weight bounded fractional matching
- Maximum weight k-element subsets of perfect matchings
- Partial vertex cover in bipartite graphs
- Partitioning a bipartite graph into proportional factors
- Rainbow matchings in bipartite graphs
- Recognition of Seymour graphs
- Skew-supermodular colouring with prescribed class-sizes
- Skew-supermodular colouring with two class sizes
- Strongly maximal matchings
- Weighted bipartite edge colouring
