The number of tournaments with the minimum number of upsets
From MaRDI portal
Publication:2303437
DOI10.1007/s00373-019-02124-0zbMath1434.05072OpenAlexW2997531076WikidataQ126413167 ScholiaQ126413167MaRDI QIDQ2303437
Burak Kurkcu, Nuri Sendil, Ilhan Hacioglu, Carlos Martins de Fonseca
Publication date: 3 March 2020
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-019-02124-0
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Boolean rank of upset tournament matrices
- New permanental bounds for Ferrers matrices
- On biclique partitions of the complete graph
- Monochromatic sinks in nearly transitive arc-colored tournaments
- Upsets in round robin tournaments
- Optimally ranking unrankable tournaments
- Short score certificates for upset tournaments
- Score certificate numbers of upset tournaments
- Inequalities for the gamma function with applications to permanents
- Random sampling of labeled tournaments
- Construction of all tournament matrices with prescribed row sum vector
- On a conjecture of Quintas and arc-traceability in upset tournaments
- Square roots of doubly regular tournament matrices
- Upsets in Round Robin Tournaments
- On Sets of Consistent Arcs in a Tournament
This page was built for publication: The number of tournaments with the minimum number of upsets
