Extremal graph packing problems: Ore-type versus Dirac-type

MaRDI QIDQ3656238zbMATH OpenFDO

Authors Gexin Yu, H. A. Kierstead, Alexandr Kostochka

Publication date 13 January 2010

Mathematics Subject Classification ID

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

Recommendations

• Ore-type graph packing problems
• An Ore-type theorem for perfect packings in graphs
• Recent advances on Dirac-type problems for hypergraphs
• Packing of graphs - a survey
• An Ore-type analogue of the Sauer-Spencer theorem

Cited in

(14)

• Extremal theorems for degree sequence packing and the two-color discrete tomography problem
• A generalization of the graph packing theorems of Sauer-Spencer and Brandt
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Embedding graphs having Ore-degree at most five
• The Turán number of sparse spanning graphs
• An extension of the Hajnal-Szemerédi theorem to directed graphs
• Equitable list coloring of sparse graphs
• On the bipartite graph packing problem
• Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
• Graphs with chromatic number close to maximum degree
• Packing directed cycles of specified odd length into digraphs and alternating cycles into bipartite graphs
• A note on relaxed equitable coloring of graphs
• On the Corrádi-Hajnal theorem and a question of Dirac
• A refinement of a result of Corrádi and Hajnal

This page was built for publication: Extremal graph packing problems: Ore-type versus Dirac-type

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