Article: The circumference of a graph with no K3,t-minor, II

File Download
Supplementary
  • Basic View
  • Metadata View
  • XML View
TitleThe circumference of a graph with no K3,t-minor, II
AuthorsChen, G
Yu, X
Zang, W
Issue Date2012
PublisherAcademic Press. The Journal's web site is located at http://www.elsevier.com/locate/jctb
CitationJournal of Combinatorial Theory Series B, 2012 [How to Cite?]
AbstractThe class of graphs with no K3;t-minors, t>=3, contains all planar graphs and plays an important role in graph minor theory. In 1992, Seymour and Thomas conjectured the existence of a function α(t)>0 and a constant β>0, such that every 3-connected n-vertex graph with no K3;t-minors, t>=3, contains a cycle of length at least α(t)nβ. The purpose of this paper is to con¯rm this conjecture with α(t)=(1/2)t(t-1) and β=log1729 2.
ISSN0095-8956
2011 Impact Factor: 0.892
2011 SCImago Journal Rankings: 0.064
DC Field
Value
dc.contributor.authorChen, G
dc.contributor.authorYu, X
dc.contributor.authorZang, W
dc.date.accessioned2012-09-20T07:56:17Z
dc.date.available2012-09-20T07:56:17Z
dc.date.issued2012
dc.description.abstractThe class of graphs with no K3;t-minors, t>=3, contains all planar graphs and plays an important role in graph minor theory. In 1992, Seymour and Thomas conjectured the existence of a function α(t)>0 and a constant β>0, such that every 3-connected n-vertex graph with no K3;t-minors, t>=3, contains a cycle of length at least α(t)nβ. The purpose of this paper is to con¯rm this conjecture with α(t)=(1/2)t(t-1) and β=log1729 2.
dc.identifier.citationJournal of Combinatorial Theory Series B, 2012 [How to Cite?]
dc.identifier.hkuros205943
dc.identifier.issn0095-8956
2011 Impact Factor: 0.892
2011 SCImago Journal Rankings: 0.064
dc.identifier.urihttp://hdl.handle.net/10722/164176
dc.languageeng
dc.publisherAcademic Press. The Journal's web site is located at http://www.elsevier.com/locate/jctb
dc.publisher.placeUnited States
dc.relation.ispartofJournal of Combinatorial Theory Series B
dc.titleThe circumference of a graph with no K3,t-minor, II
dc.typeArticle