On the Erdo"s-Śos Conjecture for graphs on n = κ + 4 vertices

Long Tu Yuan; Xiao Dong Zhang

doi:10.26493/1855-3974.905.cb4

On the Erdo"s-Śos Conjecture for graphs on n = κ + 4 vertices

Long Tu Yuan, Xiao Dong Zhang

Shanghai Jiao Tong University

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

Abstract

The Erdo"s-Śos Conjecture states that if G is a simple graph of order n with average degree more than κ -2; then G contains every tree of order k. In this paper, we prove that Erd?os-Śos Conjecture is true for n = κ + 4.

Original language	English
Pages (from-to)	49-61
Number of pages	13
Journal	Ars Mathematica Contemporanea
Volume	13
Issue number	1
DOIs	https://doi.org/10.26493/1855-3974.905.cb4
State	Published - 2017
Externally published	Yes

Keywords

Erdo"s-Śos conjecture
Maximum degree
Tree

Access to Document

10.26493/1855-3974.905.cb4

Cite this

@article{f8c42315620c49fb95535769227243ad,

title = "On the Erdo{"}s-{\'S}os Conjecture for graphs on n = κ + 4 vertices",

abstract = "The Erdo{"}s-{\'S}os Conjecture states that if G is a simple graph of order n with average degree more than κ -2; then G contains every tree of order k. In this paper, we prove that Erd?os-{\'S}os Conjecture is true for n = κ + 4.",

keywords = "Erdo{"}s-{\'S}os conjecture, Maximum degree, Tree",

author = "Yuan, \{Long Tu\} and Zhang, \{Xiao Dong\}",

year = "2017",

doi = "10.26493/1855-3974.905.cb4",

language = "英语",

volume = "13",

pages = "49--61",

journal = "Ars Mathematica Contemporanea",

issn = "1855-3966",

publisher = "Society of Mathematicians, Physicists and Astronomers of Slovenia",

number = "1",

}

TY - JOUR

T1 - On the Erdo"s-Śos Conjecture for graphs on n = κ + 4 vertices

AU - Yuan, Long Tu

AU - Zhang, Xiao Dong

PY - 2017

Y1 - 2017

N2 - The Erdo"s-Śos Conjecture states that if G is a simple graph of order n with average degree more than κ -2; then G contains every tree of order k. In this paper, we prove that Erd?os-Śos Conjecture is true for n = κ + 4.

AB - The Erdo"s-Śos Conjecture states that if G is a simple graph of order n with average degree more than κ -2; then G contains every tree of order k. In this paper, we prove that Erd?os-Śos Conjecture is true for n = κ + 4.

KW - Erdo"s-Śos conjecture

KW - Maximum degree

KW - Tree

UR - https://www.scopus.com/pages/publications/85002062795

U2 - 10.26493/1855-3974.905.cb4

DO - 10.26493/1855-3974.905.cb4

M3 - 文章

AN - SCOPUS:85002062795

SN - 1855-3966

VL - 13

SP - 49

EP - 61

JO - Ars Mathematica Contemporanea

JF - Ars Mathematica Contemporanea

IS - 1

ER -

On the Erdo"s-Śos Conjecture for graphs on n = κ + 4 vertices

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this