Constructive Quasi-Ramsey Numbers and Tournament Ranking
From MaRDI portal
Publication:4255807
DOI10.1137/S0895480197318301zbMATH Open0933.68099OpenAlexW1965059628MaRDI QIDQ4255807FDOQ4255807
Authors: Svatopluk Poljak, Vojtěch Rödl, Andrzej Czygrinow
Publication date: 27 June 1999
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895480197318301
Recommendations
- Tournament Ranking with Expected Profit in Polynomial Time
- A constructive solution to a problem of ranking tournaments
- Ordering by weighted number of wins gives a good ranking for weighted tournaments
- scientific article; zbMATH DE number 1855678
- A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Extremal combinatorics (05D99)
Cited In (17)
- Maximum dispersion problem in dense graphs
- Integer and fractional packings in dense 3‐uniform hypergraphs
- Packing triangles in regular tournaments
- Packing and Covering a Given Directed Graph in a Directed Graph
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Partitioning problems in dense hypergraphs
- Voting procedures, complexity of
- Integer and fractional packings of hypergraphs
- On characterizing hypergraph regularity
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
- Intersections of random hypergraphs and tournaments
- Packing edge-disjoint triangles in regular and almost regular tournaments
- An improved MST algorithm for ranking players of a round-robin tournament
- Packing directed cycles efficiently
- A survey on the linear ordering problem for weighted or unweighted tournaments
- An application of the Ramsey theorem to ordered r-tournaments
- Almost given length cycles in digraphs
This page was built for publication: Constructive Quasi-Ramsey Numbers and Tournament Ranking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4255807)