Work

Covering Multigraphs With Bipartite Graphs

Year: 2026
Type: article
Abstract: ABSTRACT 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.
Language: English
Open Access status: green
OpenAlex ID: W4366999794
FWCI: 1.869
Cites: 15
Cited by: 3
Related to: 10