A note on some embedding problems for oriented graphs

Andrew Treglown

doi:10.1002/jgt.20586

A note on some embedding problems for oriented graphs

Andrew Treglown

Mathematics

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

6 Citations (Scopus)

182 Downloads (Pure)

Abstract

We conjecture that every oriented graph G on n vertices with δ+(G), δ−(G)≥5n/12 contains the square of a Hamilton cycle. We also give a conjectural bound on the minimum semidegree which ensures a perfect packing of transitive triangles in an oriented graph. A link between Ramsey numbers and perfect packings of transitive tournaments is also considered

Original language	English
Pages (from-to)	330-336
Journal	Journal of Graph Theory
Volume	69
Early online date	1 Feb 2011
DOIs	https://doi.org/10.1002/jgt.20586
Publication status	Published - 16 Feb 2012

Access to Document

10.1002/jgt.20586Licence: None: All rights reserved

Treglown_A_note_on_some_embedding_Journal_of_Graph_Theory_2011
This is the peer reviewed version of the following article: Treglown, A. (2012), A note on some embedding problems for oriented graphs. J. Graph Theory, 69: 330–336. doi:10.1002/jgt.20586 , which has been published in final form athttp://onlinelibrary.wiley.com/doi/10.1002/jgt.20586/full. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Self-Archiving.
Accepted author manuscript, 108 KB

http://onlinelibrary.wiley.com/doi/10.1002/jgt.20586/fullLicence: None: All rights reserved

Directed graphs and the regularity method
Kuhn, D. (Principal Investigator) & Osthus, D. (Co-Investigator)
Engineering & Physical Science Research Council
1/10/07 → 31/03/11
Project: Research Councils

Cite this

@article{9ac7e6d11628480ca132a5fde87c4ee8,

title = "A note on some embedding problems for oriented graphs",

abstract = "We conjecture that every oriented graph G on n vertices with δ+(G), δ−(G)≥5n/12 contains the square of a Hamilton cycle. We also give a conjectural bound on the minimum semidegree which ensures a perfect packing of transitive triangles in an oriented graph. A link between Ramsey numbers and perfect packings of transitive tournaments is also considered",

author = "Andrew Treglown",

year = "2012",

month = feb,

day = "16",

doi = "10.1002/jgt.20586",

language = "English",

volume = "69",

pages = "330--336",

journal = "Journal of Graph Theory",

issn = "0364-9024",

publisher = "Wiley",

}

TY - JOUR

T1 - A note on some embedding problems for oriented graphs

AU - Treglown, Andrew

PY - 2012/2/16

Y1 - 2012/2/16

N2 - We conjecture that every oriented graph G on n vertices with δ+(G), δ−(G)≥5n/12 contains the square of a Hamilton cycle. We also give a conjectural bound on the minimum semidegree which ensures a perfect packing of transitive triangles in an oriented graph. A link between Ramsey numbers and perfect packings of transitive tournaments is also considered

AB - We conjecture that every oriented graph G on n vertices with δ+(G), δ−(G)≥5n/12 contains the square of a Hamilton cycle. We also give a conjectural bound on the minimum semidegree which ensures a perfect packing of transitive triangles in an oriented graph. A link between Ramsey numbers and perfect packings of transitive tournaments is also considered

U2 - 10.1002/jgt.20586

DO - 10.1002/jgt.20586

M3 - Article

SN - 0364-9024

VL - 69

SP - 330

EP - 336

JO - Journal of Graph Theory

JF - Journal of Graph Theory

ER -

A note on some embedding problems for oriented graphs

Abstract

Access to Document

Fingerprint

Projects

Directed graphs and the regularity method

Cite this