Packing 4-cycles in Eulerian and bipartite Eulerian tournaments with an application to distances in interchange graphs

Simple item page
dc.creatorYuster, Raphael
dc.date2003-10-26
dc.date.accessioned2026-07-07T05:02:16Z
dc.date.available2026-07-07T05:02:16Z
dc.descriptionWe prove that every Eulerian orientation of $K_{m,n}$ contains $\frac{1}{4+\sqrt{8}}mn(1-o(1))$ arc-disjoint directed 4-cycles, improving earlier lower bounds. Combined with a probabilistic argument, this result is used to prove that every regular tournament with $n$ vertices contains $\frac{1}{8+\sqrt{32}}n^2(1-o(1))$ arc-disjoint directed 4-cycles. The result is also used to provide an upper bound for the distance between two antipodal vertices in interchange graphs.
dc.description9 Pages
dc.identifierhttps://arxiv.org/abs/math/0310411
dc.identifierhttp://arxiv.org/abs/math/0310411
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/68988
dc.subjectCombinatorics
dc.subject05C20; 05C70
dc.titlePacking 4-cycles in Eulerian and bipartite Eulerian tournaments with an application to distances in interchange graphs
dc.typetext

Files

Collections

arXiv