Embedding graphs having Ore-degree at most five
| Autor: | Judit Nagy-György, Béla Csaba |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2017 |
| Předmět: | |
| Popis: | 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.$ Comment: accepted for publication at SIAM J. Disc. Math |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|