Answers are grounded in this paper and cite their sources.
Hansel's lemma states , where is a collection of bipartite graphs covering all the edges of . We generalize this lemma to the corresponding multigraph covering problem and the graphon covering problem. We also prove an upper bound on which shows that our generalization is asymptotically tight in some sense.
No takes yet. Share an insight, caveat, or question.
Kim et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: