On 5-Cycles and 6-Cycles in Regular n-Tournaments
From MaRDI portal
Publication:2825479
DOI10.1002/jgt.21914zbMath1346.05098OpenAlexW2462997444MaRDI QIDQ2825479
Publication date: 13 October 2016
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.21914
tournamenttransitive tournamentregular tournamentdoubly regular tournamentquadratic residue tournamentlocally transitive tournament
Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)
Related Items
Bounds on the number of compatible \(k\)-simplices matching the orientation of the \((k-1)\)-skeleton of a simplex, On the number of 7-cycles in regular \(n\)-tournaments, Minimizing cycles in tournaments and normalized \(q\)-norms, On explicit random-like tournaments, The Shifted Turán Sieve Method on Tournaments, Cycles of a given length in tournaments
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solution of the conjecture of Brualdi and Li
- Autonomous parts and decomposition of regular tournaments
- Normal matrices and their principal submatrices of co-order one
- On tournament matrices
- Algebraic multiplicity of the eigenvalues of a tournament matrix
- Near-homogeneous tournaments and permutation groups
- Pick's inequality and tournaments
- Properties of the Brualdi-Li tournament matrix
- On almost regular tournament matrices
- On the number of 7-cycles in regular \(n\)-tournaments
- Doubly regular tournaments are equivalent to skew Hadamard matrices
- Some remarks on tournament matrices
- On 4-Cycles and 5-Cycles in Regular Tournaments
- Caracterisation Des Tournois Presqu'Homogenes
- A Note on the Number of 4-Circuits in a Tournament
- Construction d'une nouvelle classe de tournois presqu'homogènes
- The Maximum Number of Strongly Connected Subtournaments*
- On the characteristic roots of tournament matrices
- THE TREATMENT OF TIES IN RANKING PROBLEMS
