Embedding graphs having Ore-degree at most five
Combinatorics
2019-01-01 v2
Abstract
Let and be graphs on vertices, where is sufficiently large. We prove that if has Ore-degree at most 5 and has minimum degree at least then
Keywords
Cite
@article{arxiv.1707.07216,
title = {Embedding graphs having Ore-degree at most five},
author = {Béla Csaba and Judit Nagy-György},
journal= {arXiv preprint arXiv:1707.07216},
year = {2019}
}
Comments
accepted for publication at SIAM J. Disc. Math