Covering Multigraphs With Bipartite Graphs

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.

Authors

Institutions

Publication Details

Journal
Journal of Graph Theory
Published
2026-11-13
DOI
https://doi.org/10.1002/jgt.70154
Citations
3
Primary Topic
Limits and Structures in Graph Theory
Type
article
Field-Weighted Citation Impact
1.87

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Covering Multigraphs With Bipartite Graphs

Hyun-Woo Lee, Jaehoon Kim
3 citations
Journal of Graph Theory
Limits and Structures in Graph Theory
1.87
article

Covering Multigraphs With Bipartite Graphs

Hyun-Woo Lee, Jaehoon Kim
article en
3 citations

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.

Journal of Graph Theory
Korea Advanced Institute of Science and Technology (KR)
POSCO TJ Park Foundation, National Research Foundation, National Research Foundation of Korea, Institute for Basic Science, Ministry of Science and ICT, South Korea
Openalex Percentile: Top 24%
Limits and Structures in Graph Theory
1.87
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon