Paths and cycles in tournaments-Reference-Cited by-同舟云学术

Paths and cycles in tournaments

Published:1986 Issue:1 Volume:296 Page:167-180
ISSN:0002-9947
Container-title:Transactions of the American Mathematical Society
language:en
Short-container-title:Trans. Amer. Math. Soc.

Author:

Thomason Andrew

Abstract

Sufficient conditions are given for the existence of an oriented path with given end vertices in a tournament. As a consequence a conjecture of Rosenfeld is established. This states that if n n is large enough, then every non-strongly oriented cycle of order n n is contained in every tournament of order n n .

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,General Mathematics

Link

http://www.ams.org/tran/1986-296-01/S0002-9947-1986-0837805-6/S0002-9947-1986-0837805-6.pdf

Reference11 articles.

1. Realization of certain generalized paths in tournaments;Alspach, Brian;Discrete Math.,1981

2. On the existence of specified cycles in a tournament;Benhocine, Abdelhamid;J. Graph Theory,1983

3. London Mathematical Society Monographs;Bollobás, Béla,1978

4. Parity of paths and circuits in tournaments;Forcade, Rodney;Discrete Math.,1973

5. Antidirected Hamiltonian paths in tournaments;Grünbaum, Branko;J. Combinatorial Theory Ser. B,1971

Cited by 41 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Directed graphs with lower orientation Ramsey thresholds;RAIRO - Operations Research;2024-07

2. Oriented Trees and Paths in Digraphs;Surveys in Combinatorics 2024;2024-06-13

3. Ramsey numbers of sparse digraphs;Israel Journal of Mathematics;2024-04-24

4. The Existence of a Path with Two Blocks in Digraphs;Graphs and Combinatorics;2024-03-12

5. On the oriented coloring of the disjoint union of graphs;RAIRO - Operations Research;2024-01