Pages that link to "Matching in hypergraphs"
From HandWiki
The following pages link to Matching in hypergraphs:
Displayed 23 items.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- Abstract simplicial complex (← links)
- Helly family (← links)
- Kőnig's theorem (graph theory) (← links)
- Maximum cardinality matching (← links)
- Sperner's lemma (← links)
- List of unsolved problems in mathematics (← links)
- Knaster–Kuratowski–Mazurkiewicz lemma (← links)
- Matching (graph theory) (← links)
- Perfect matching in high-degree hypergraphs (← links)
- Ryser's conjecture (← links)
- Bipartite hypergraph (← links)
- Matching in hypergraphs (← links)
- Vertex cover in hypergraphs (← links)
- Hypergraph (← links)
- Hall-type theorems for hypergraphs (← links)
- Balanced hypergraph (← links)
- D-interval hypergraph (← links)
- Max-min item allocation (← links)
- Rainbow-independent set (← links)
- Width of a hypergraph (← links)
- Egalitarian item allocation (← links)
- Chessboard complex (← links)
- Biography:Zoltán Füredi (← links)
