Pages that link to "Item:Q687713"
From MaRDI portal
The following pages link to On a criterion for matchability in hypergraphs (Q687713):
Displaying 12 items.
- On the fractional matching polytope of a hypergraph (Q684403) (← links)
- On a possible extension of Hall's theorem to bipartite hypergraphs (Q750464) (← links)
- Matchings in n-partite n-graphs (Q1820172) (← links)
- A condition for matchability in hypergraphs (Q1900519) (← links)
- Maximum size of a graph with given fractional matching number (Q2088698) (← links)
- Matching orderable and separable hypergraphs (Q2136876) (← links)
- Matching critical intersection hypergraphs (Q2968611) (← links)
- Hypergraphs. Combinatorics of finite sets. Transl. from the French (Q3993087) (← links)
- A linear programming perspective on the Frankl?R�dl?Pippenger theorem (Q4870539) (← links)
- A generalization of Hall's theorem for $k$-uniform $k$-partite hypergraphs (Q5135735) (← links)
- A geometric theory for hypergraph matching (Q5497101) (← links)
- Some remarks on hypergraph matching and the Füredi–Kahn–Seymour conjecture (Q6077050) (← links)
