Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer
From MaRDI portal
Publication:3438140
DOI10.1017/S0963548306007929zbMath1117.05057OpenAlexW1979767977MaRDI QIDQ3438140
Hemanshu Kaul, Alexandr V. 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
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (8)
A list version of graph packing ⋮ Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem ⋮ An Ore-type analogue of the Sauer-Spencer theorem ⋮ Packing two graphs of even girth 10 ⋮ Rainbow spanning subgraphs in bounded edge-colourings of graphs with large minimum degree ⋮ On a graph packing conjecture by Bollobás, Eldridge and Catlin ⋮ Packing Graphs of Bounded Codegree ⋮ Ore-type conditions implying 2-factors consisting of short cycles
This page was built for publication: Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer
