New answers tagged matching-theory
2
votes
Accepted
Maximal matchable set in hypergraph with finite edges
Let $n = 2$, and $H$ be the complete bipartite graph with halves $V_1$ a copy of $\mathbb{N}$ and $V_2$ a copy of $\mathbb{R}$. Let $r(M)$ be an element of $V_2$ not covered by a matching $M$. If $M$ ...
Top 50 recent answers are included
Related Tags
matching-theory × 146graph-theory × 116
co.combinatorics × 69
perfect-matchings × 50
bipartite-graphs × 18
algorithms × 17
hypergraph × 16
graph-colorings × 14
infinite-combinatorics × 13
reference-request × 9
set-theory × 5
combinatorial-optimization × 5
extremal-graph-theory × 5
enumerative-combinatorics × 4
linear-algebra × 3
spectral-graph-theory × 3
heuristics × 3
discrete-geometry × 2
computational-complexity × 2
terminology × 2
lattice-theory × 2
algebraic-combinatorics × 2
matroid-theory × 2
cycles × 2
latin-square × 2