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.
Source: Journal of Graph Theory
DOI: 10.1002/jgt.70154
Authors: Jaehoon Kim, Hyunwoo Lee
Institution: Korea Advanced Institute of Science and Technology
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
Awards: G1474807751, G2765210714, G6572798828
OpenAlex ID: W4366999794
