Packing Graphs of Bounded Codegree

DOI10.1017/S0963548318000032zbMath1398.05160arXiv1605.05599MaRDI QIDQ4962588

Ross J. Kang, Wouter Cames van Batenburg

Publication date: 5 November 2018

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

zbMATH Keywords

maximum adjacent codegree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Packing a number of copies of a \(( p , q )\)-graph

Cites Work

• Edge disjoint placement of graphs
• On a graph packing conjecture by Bollobás, Eldridge and Catlin
• Packings of graphs and applications to computational complexity
• Subgraphs of graphs. I
• A near packing of two graphs
• Proof of a conjecture of Bollobás and Eldridge for graphs of maximum degree three
• Packing \(d\)-degenerate graphs
• Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer
• Embedding Arbitrary Graphs of Maximum Degree Two
• Packing random graphs and hypergraphs
• On the Bollobás–Eldridge Conjecture for Bipartite Graphs
• On Two Conjectures on Packing of Graphs
• Graph colouring and the probabilistic method

This page was built for publication: Packing Graphs of Bounded Codegree