On a packing problem of Alon and Yuster

DOI10.1016/j.disc.2016.05.023zbMath1339.05317OpenAlexW2427827503MaRDI QIDQ2629291

Derrek Yager, Alexandr V. Kostochka, Andrew McConvey

Publication date: 5 July 2016

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

Full work available at URL: https://doi.org/10.1016/j.disc.2016.05.023

zbMATH Keywords

maximum degreeedge sumgraph packing

Mathematics Subject Classification ID

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

Related Items (1)

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

Cites Work

• The Turán number of sparse spanning graphs
• Edge disjoint placement of graphs
• Arc coverings of graphs
• Packing of graphs with small product of sizes
• Packings of graphs and applications to computational complexity
• Packing \(d\)-degenerate graphs

This page was built for publication: On a packing problem of Alon and Yuster