Embedding graphs having Ore-degree at most five
Abstract
Let H and G be graphs on n vertices, where n is sufficiently large. We prove that if H has Ore-degree at most 5 and G has minimum degree at least 2n/3 then H⊂ G.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.