Score certificate numbers of upset tournaments

From MaRDI portal
(Redirected from Publication:1570835)

DOI10.1016/S0166-218X(99)00243-7MaRDI QIDQ1570835zbMATH OpenOpenAlexFDO

Authors Jeffrey L. Poet, Bryan L. Shader

Publication date 28 May 2001

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0166-218x(99)00243-7


zbMATH Keywords

digraphscore certificatescore-listtournament

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)




Review text

A tournament \(T\) is a directed graph on a finite vertex set. The score-list of \(T\) is the multiset of the outdegrees of its vertices. The score certificate of \(T\) is a collection of arcs of \(T\), which can be uniquely completed to a tournament with the same score-list as \(T\)'s. The score certificate number of \(T\) is the least number of arcs in a score certificate of \(T\). The paper establishes the lower and upper bounds for the score certificate numbers of the class of upset tournaments. Notice that the lower and upper bounds differ by at most 2.


Recommendations


Cites work


Cited in
(6)








This page was built for publication: Score certificate numbers of upset tournaments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1570835)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Score_certificate_numbers_of_upset_tournaments&oldid=72217611"
Powered by MediaWiki