An Ore-type analogue of the Sauer-Spencer theorem

DOI10.1007/S00373-007-0732-1zbMATH Open1125.05081OpenAlexW2079690680MaRDI QIDQ2385133FDOQ2385133

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

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

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)

Cites Work

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

Cited In (7)

• Packing of graphs with small product of sizes
• Graphs containing every 2-factor
• Embedding Graphs Having Ore-Degree at Most Five
• 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
• Extremal graph packing problems: Ore-type versus Dirac-type

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)