On the bipartite graph packing problem

2016/04/04 by Vásárhelyi, Bálint
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1604.00934

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.

Related

• A list version of graph packing
• Packing graphs of bounded codegree
• Packing spanning graphs from separable families
• Packing colourings in complete bipartite graphs and the inverse problem for correspondence packing
• Breaking the Bollobás-Eldridge-Catlin Barrier for Bipartite Graphs