An Ore-type analogue of the Sauer-Spencer theorem

DOI10.1007/S00373-007-0732-1MaRDI QIDQ2385133zbMATHOpenAlexFDO

Authors Gexin Yu, Alexandr Kostochka

Publication date 11 October 2007

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-007-0732-1

zbMATH Keywords

Graph packingOre-type conditions

Mathematics Subject Classification ID

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

Recommendations

• Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer
• 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
• Toward Żak's conjecture on graph packing

Cites work

• scientific article; zbMATH DE number 2123255 (Why is no real title available?)
• Edge disjoint placement of graphs
• Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer
• Note on Hamilton Circuits
• On a graph packing conjecture by Bollobás, Eldridge and Catlin
• On the existence of disjoint cycles in a graph
• On the maximum number of independent cycles in a graph
• Packings of graphs and applications to computational complexity
• Some Theorems on Abstract Graphs
• Subgraphs of graphs. I

Cited in

(7)

• Packing of graphs with small product of sizes
• Extremal graph packing problems: Ore-type versus Dirac-type
• Ore-type conditions implying 2-factors consisting of short cycles
• Efficient graph packing via game colouring
• Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer
• Embedding graphs having Ore-degree at most five
• Graphs containing every 2-factor

This page was built for publication: An Ore-type analogue of the Sauer-Spencer theorem

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