Pages that link to "Item:Q1872893"
From MaRDI portal
The following pages link to Perfect matchings in balanced hypergraphs---a combinatorial approach (Q1872893):
Displaying 13 items.
- A note on the duality between matchings and vertex covers in balanced hypergraphs (Q306113) (← links)
- On a criterion for matchability in hypergraphs (Q687713) (← links)
- Hall's and Kőnig's theorem in graphs and hypergraphs (Q1660258) (← links)
- A condition for matchability in hypergraphs (Q1900519) (← links)
- Perfect \(f\)-matchings and \(f\)-factors in hypergraphs -- a combinatorial approach (Q2012539) (← links)
- On the König-Hall-Egerváry theorem for multidimensional matrices and multipartite hypergraphs (Q2032871) (← links)
- Finding perfect matchings in bipartite hypergraphs (Q2416439) (← links)
- Balanced matrices (Q2433704) (← links)
- An extension of Hall's theorem for partitioned bipartite graphs (Q2630339) (← links)
- Ear-slicing for matchings in hypergraphs (Q2657060) (← links)
- AN ALTERNATIVE PROOF OF LOVASZ'S CATHEDRAL THEOREM (Q3189322) (← links)
- Minimax theorems for normal hypergraphs and balanced hypergraphs - a survey (Q3216697) (← links)
- A generalization of Hall's theorem for $k$-uniform $k$-partite hypergraphs (Q5135735) (← links)