Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer

DOI10.1017/S0963548306007929MaRDI QIDQ3438140zbMATH OpenOpenAlexFDO

Authors Hemanshu Kaul, Alexandr Kostochka

Publication date 15 May 2007

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

Full work available at URL https://doi.org/10.1017/s0963548306007929

Mathematics Subject Classification ID

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

Recommendations

• An Ore-type analogue of the Sauer-Spencer theorem
• On a graph packing conjecture by Bollobás, Eldridge and Catlin
• Packing of graphs with small product of sizes
• On Packing Two Graphs with Bounded Sum of Sizes and Maximum Degree
• A near packing of two graphs

Cited in

(12)

• Ore-type conditions implying 2-factors consisting of short cycles
• On packing bipartite graphs
• Packing two graphs of even girth 10
• Rainbow spanning subgraphs in bounded edge-colourings of graphs with large minimum degree
• An Ore-type analogue of the Sauer-Spencer theorem
• A list version of graph packing
• Extremal theorems for degree sequence packing and the two-color discrete tomography problem
• Packing graphs of bounded codegree
• On Packing Two Graphs with Bounded Sum of Sizes and Maximum Degree
• A generalization of the graph packing theorems of Sauer-Spencer and Brandt
• Packing of graphs with small product of sizes
• On a graph packing conjecture by Bollobás, Eldridge and Catlin

This page was built for publication: Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3438140)