All Questions
1 question with no upvoted or accepted answers
0
votes
0
answers
70
views
Birkhoff's theorem for hypergraphs
Birkhoff's theorem says that, in a bipartite graph $G$ in which both sides have size $n$, any fractional matching of size $n$ can be presented as a convex combination of integral matchings of size $n$ ...