On the bipartite graph packing problem

DOI10.1016/j.dam.2017.04.019zbMath1365.05235arXiv1604.00934OpenAlexW2963313760MaRDI QIDQ2357142

Bálint Vásárhelyi

Publication date: 19 June 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.00934

zbMATH Keywords

bipartitedegree sequencegraph packing

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)

Related Items (1)

Embedding Graphs Having Ore-Degree at Most Five

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Edge disjoint placement of graphs
• A theorem on flows in networks
• An \(\Omega{} (n^{4/3})\) lower bound on the randomized complexity of graph properties
• On packing bipartite graphs
• Packing bipartite graphs
• Subgraphs of graphs. I
• Weighted sums of certain dependent random variables
• Spanning Trees in Dense Graphs
• Combinatorial Properties of Matrices of Zeros and Ones
• Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem
• Graph Factors and Matching Extensions
• Packing two bipartite graphs into a complete bipartite graph
• Probability Inequalities for Sums of Bounded Random Variables

This page was built for publication: On the bipartite graph packing problem