The ErdAsaSA3s conjecture for spiders of large size

The ErdAsaSA3s conjecture for spiders of large size

The ErdAsaSA3s Conjecture states that if GG is a graph with average degree more than ka1ka1, then GG contains every tree with kk edges. A spider is a tree with at most one vertex of degree more than 2. In this paper, we prove that if GG is a graph on nn vertices with average degree more than ka1ka1,...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Discrete mathematics 2013-11, Vol.313 (22), p.2513-2517
1. Verfasser: Fan, Genghua
Format: Artikel
Sprache:eng
Schlagworte:
Graphs
Mathematical analysis
Spiders
Trees
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The ErdAsaSA3s Conjecture states that if GG is a graph with average degree more than ka1ka1, then GG contains every tree with kk edges. A spider is a tree with at most one vertex of degree more than 2. In this paper, we prove that if GG is a graph on nn vertices with average degree more than ka1ka1, then GG contains every spider with kk edges, where kaYn+52.
ISSN:0012-365X
DOI:10.1016/j.disc.2013.07.021