On the bipartite graph packing problem
Combinatorics
2017-05-03 v2
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.
Keywords
Cite
@article{arxiv.1604.00934,
title = {On the bipartite graph packing problem},
author = {Bálint Vásárhelyi},
journal= {arXiv preprint arXiv:1604.00934},
year = {2017}
}