Constructive quasi-ramsey numbers and tournament ranking

A. Czygrinow, S. Poljak, V. Rödl

Research output: Contribution to journalArticlepeer-review

21 Scopus citations


A constructive lower bound on the quasi-Ramsey numbers and the tournament ranking function was obtained in [S. Poljak, V. Rödl, and J. Spencer, SIAM J. Discrete Math., (1) 1988, pp. 372-376]. We consider the weighted versions of both problems. Our method yields a polynomial time heuristic with guaranteed lower bound for the linear ordering problem.

Original languageEnglish (US)
Pages (from-to)48-63
Number of pages16
JournalSIAM Journal on Discrete Mathematics
Issue number1
StatePublished - 1999
Externally publishedYes


  • Derandomization
  • Discrepancy
  • Linear ordering problem
  • Regularity lemma

ASJC Scopus subject areas

  • General Mathematics


Dive into the research topics of 'Constructive quasi-ramsey numbers and tournament ranking'. Together they form a unique fingerprint.

Cite this