The following pages link to Matchings in n-partite n-graphs (Q1820172):
Displaying 8 items.
- On the fractional matching polytope of a hypergraph (Q684403) (← links)
- On a criterion for matchability in hypergraphs (Q687713) (← links)
- On a possible extension of Hall's theorem to bipartite hypergraphs (Q750464) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- A condition for matchability in hypergraphs (Q1900519) (← links)
- Maximum size of a graph with given fractional matching number (Q2088698) (← links)
- Hall's theorem for hypergraphs (Q4518333) (← links)
- A generalization of Hall's theorem for $k$-uniform $k$-partite hypergraphs (Q5135735) (← links)
