𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Endpoint extendable paths in tournaments

✍ Scribed by Faudree, Ralph J.; Gy�rf�s, Andr�s

Publisher
John Wiley and Sons
Year
1996
Tongue
English
Weight
254 KB
Volume
23
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

Let s(n) be the threshold for which each directed path of order smaller than s ( n ) is extendible from one of its endpoints in some tournament T,. It is shown that s(n) is asymptotic to 3n/4, with an error term at most 3 for infinitely many n. There are six tournaments with s ( n ) = n.

📜 SIMILAR VOLUMES

Solution of a conjecture of Tewes and Vo
Solution of a conjecture of Tewes and Volkmann regarding extendable cycles in in-tournaments
✍ Dirk Meierling 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 110 KB 👁 1 views

## Abstract A directed cycle __C__ of a digraph __D__ is extendable if there exists a directed cycle __C__′ in __D__ that contains all vertices of __C__ and an additional one. In 1989, Hendry defined a digraph __D__ to be cycle extendable if it contains a directed cycle and every non‐Hamiltonian di

Finding an Oriented Hamiltonian Path in
Finding an Oriented Hamiltonian Path in a Tournament
✍ Frédéric Havet 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 153 KB

We present an O n algorithm for finding a specified oriented path of order at Ž 2 . least n in a tournament of order n. Using this algorithm, we present an O n algorithm that finds a specified oriented path from a given vertex if one exists.

Oriented Hamiltonian Paths in Tournament
Oriented Hamiltonian Paths in Tournaments: A Proof of Rosenfeld's Conjecture
✍ Frédéric Havet; Stéphan Thomassé 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 284 KB

We prove that with three exceptions, every tournament of order n contains each oriented path of order n. The exceptions are the antidirected paths in the 3-cycle, in the regular tournament on 5 vertices, and in the Paley tournament on 7 vertices. ## 2000 Academic Press Tournaments are very rich st

Solution of a conjecture of Volkmann on
Solution of a conjecture of Volkmann on longest paths through an arc in strongly connected in-tournaments
✍ Dirk Meierling 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB 👁 1 views

## Abstract An in‐tournament is an oriented graph such that the negative neighborhood of every vertex induces a tournament. Let __m__ = 4 or __m__ = 5 and let __D__ be a strongly connected in‐tournament of order ${{n}}\geq {{2}}{{m}}-{{2}}$ such that each arc belongs to a directed path of order at

Performance Optimization Using Extended
Performance Optimization Using Extended Critical Path Analysis in Multithreaded Programs on Multiprocessors
✍ Magnus Broberg; Lars Lundberg; Håkan Grahn 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 487 KB

Efficient performance tuning of parallel programs is often hard. Optimization is often done when the program is written as a last effort to increase the performance. With sequential programs each (executed) code segment will affect the completion time. In the case of a parallel program executed on a