On the bipartite graph packing problem
B\'alint V\'as\'arhelyi
TL;DR
This paper investigates the bipartite graph packing problem, providing nearly optimal conditions under which two bipartite sequences can be packed together, advancing theoretical understanding in graph theory.
Contribution
It introduces almost tight conditions for the packability of two bipartite sequences, extending existing graph packing results to bipartite graphs.
Findings
Established nearly tight packability conditions for bipartite sequences
Extended graph packing theory to bipartite graphs
Provided theoretical bounds for bipartite graph packing
Abstract
The graph packing problem is a well-known area in graph theory. We consider a bipartite version and give almost tight conditions on the packability of two bipartite sequences.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.