Embedding graphs having Ore-degree at most five
classification
🧮 math.CO
keywords
graphsore-degreedegreeembeddingfivehavinglargeleast
read the original 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\subset G.$
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.