Paths and cycles in tournaments

@inproceedings{Thomason1986PathsAC,
  title={Paths and cycles in tournaments},
  author={Andrew Thomason},
  year={1986}
}
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 is large enough, then every non-strongly oriented cycle of order n is contained in every tournament of order n. It is well known and easy to see that every tournament has a directed hamilton path. Rosenfeld [8] conjectured that if n is large enough, then any oriented path of order n is contained in any… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 21 CITATIONS

Orientations and colouring of graphs

VIEW 9 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

On cycles in directed graphs

VIEW 11 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Arbitrary Orientations of Hamilton Cycles in Oriented Graphs

  • Electr. J. Comb.
  • 2009
VIEW 10 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Paths , Trees and Cycles in Tournaments

VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Digraphs - theory, algorithms and applications

VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Oriented Hamiltonian Cycles in Tournaments

  • J. Comb. Theory, Ser. B
  • 2000
VIEW 12 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

On the existence of specified cycles in bipartite tournaments

VIEW 5 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Substructures in large graphs

VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Arbitrary Orientations of Hamilton Cycles in Digraphs

VIEW 5 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

A proof of Sumner's universal tournament conjecture for large tournaments

  • Electronic Notes in Discrete Mathematics
  • 2011
VIEW 3 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

References

Publications referenced by this paper.
SHOWING 1-7 OF 7 REFERENCES

The existence of certain types of semi-walks in tournaments

H. J. Straight
  • (Proc. XI Southeastern Conference on Combinatorics, Graph Theory and Computing), Congress. Numer
  • 1980
VIEW 2 EXCERPTS