Packing triangles in regular tournaments

Raphael Yuster

doi:10.1002/jgt.21691

Packing triangles in regular tournaments

Raphael Yuster

Department of Mathematics

University of Haifa

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

Abstract

We prove that a regular tournament with n vertices has more than n ²/11.5(1-o(1)) pairwise arc-disjoint directed triangles. On the other hand, we construct regular tournaments with a feedback arc set of size less than n²/8, so these tournaments do not have n²/8 pairwise arc-disjoint triangles.

Original language	American English
Pages (from-to)	58-66
Number of pages	9
Journal	Journal of Graph Theory
Volume	74
Issue number	1
DOIs	https://doi.org/10.1002/jgt.21691
State	Published - Sep 2013

Keywords

fractional
packing
tournament

All Science Journal Classification (ASJC) codes

Geometry and Topology

Access to Document

10.1002/jgt.21691

Cite this

@article{767c9daf3db74b21ab583c0ba25433d2,

title = "Packing triangles in regular tournaments",

abstract = "We prove that a regular tournament with n vertices has more than n 2/11.5(1-o(1)) pairwise arc-disjoint directed triangles. On the other hand, we construct regular tournaments with a feedback arc set of size less than n2/8, so these tournaments do not have n2/8 pairwise arc-disjoint triangles.",

keywords = "fractional, packing, tournament",

author = "Raphael Yuster",

year = "2013",

month = sep,

doi = "10.1002/jgt.21691",

language = "American English",

volume = "74",

pages = "58--66",

journal = "Journal of Graph Theory",

issn = "0364-9024",

publisher = "Wiley-Liss Inc.",

number = "1",

}

TY - JOUR

T1 - Packing triangles in regular tournaments

AU - Yuster, Raphael

PY - 2013/9

Y1 - 2013/9

N2 - We prove that a regular tournament with n vertices has more than n 2/11.5(1-o(1)) pairwise arc-disjoint directed triangles. On the other hand, we construct regular tournaments with a feedback arc set of size less than n2/8, so these tournaments do not have n2/8 pairwise arc-disjoint triangles.

AB - We prove that a regular tournament with n vertices has more than n 2/11.5(1-o(1)) pairwise arc-disjoint directed triangles. On the other hand, we construct regular tournaments with a feedback arc set of size less than n2/8, so these tournaments do not have n2/8 pairwise arc-disjoint triangles.

KW - fractional

KW - packing

KW - tournament

UR - http://www.scopus.com/inward/record.url?scp=84879880394&partnerID=8YFLogxK

U2 - 10.1002/jgt.21691

DO - 10.1002/jgt.21691

M3 - Article

SN - 0364-9024

VL - 74

SP - 58

EP - 66

JO - Journal of Graph Theory

JF - Journal of Graph Theory

IS - 1

ER -

Packing triangles in regular tournaments

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Cite this