A note on even cycles and quasirandom tournaments

Subrahmanyam Kalyanasundaram, Asaf Shapira

Research output: Contribution to journalArticlepeer-review

7 Scopus citations

Abstract

A cycle C={v1,v2,.,v1} in a tournament T is said to be even, if when walking along C, an even number of edges point in the wrong direction, that is, they are directed from vi+1 to vi. In this short article, we show that for every fixed even integer k≥4, if close to half of the k-cycles in a tournament T are even, then T must be quasirandom.This resolves an open question raised in 1991 by Chung and Graham 1991.

Original languageEnglish
Pages (from-to)260-266
Number of pages7
JournalJournal of Graph Theory
Volume73
Issue number3
DOIs
StatePublished - Jul 2013

Keywords

  • eigenvalues
  • quasirandomness
  • tournament

Fingerprint

Dive into the research topics of 'A note on even cycles and quasirandom tournaments'. Together they form a unique fingerprint.

Cite this