CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
research
Embedding graphs having Ore-degree at most five
Authors
Béla Csaba
Judit Nagy-György
Publication date
29 December 2018
Publisher
Doi
Cite
View
on
arXiv
Abstract
Let
H
H
H
and
G
G
G
be graphs on
n
n
n
vertices, where
n
n
n
is sufficiently large. We prove that if
H
H
H
has Ore-degree at most 5 and
G
G
G
has minimum degree at least
2
n
/
3
2n/3
2
n
/3
then
H
⊂
G
.
H\subset G.
H
⊂
G
.
Comment: accepted for publication at SIAM J. Disc. Mat
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
SZTE Publicatio Repozitórium - SZTE - Repository of Publications
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:publicatio.bibl.u-szeged.h...
Last time updated on 27/09/2019