On scores in tournaments

DOI10.2478/AUSI-2018-0013zbMath1421.05050OpenAlexW2910480389MaRDI QIDQ2326169

T. A. Naikoo

Publication date: 7 October 2019

Published in: Acta Universitatis Sapientiae. Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/ausi-2018-0013

zbMATH Keywords

scoretournamentLandau's theoremscore sequence

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Score sets in \(k\)-partite tournaments
• On score sets in tournaments
• Score sequences in oriented graphs
• Score lists in \( (h, k)\)-bipartite hypertournaments
• Degree sequence of oriented \(k\)-hypergraphs
• Score lists in tripartite hypertournaments
• Mark sequences in digraphs
• Scores, inequalities and regular hypertournaments
• Score sequences of oriented graphs
• Score sets in oriented graphs
• Landau's inequalities for tournament scores and a short proof of a theorem on transitive sub-tournaments
• Uniform sampling ofk-hypertournaments
• Inequalities for marks in digraphs

This page was built for publication: On scores in tournaments