Constructive Quasi-Ramsey Numbers and Tournament Ranking

DOI10.1137/S0895480197318301zbMath0933.68099OpenAlexW1965059628MaRDI QIDQ4255807

Vojtěch Rödl, Svatopluk Poljak, 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

zbMATH Keywords

regularity lemmadiscrepancyderandomizationlinear ordering problem

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Extremal combinatorics (05D99)

Related Items (16)

On characterizing hypergraph regularity ⋮ Integer and fractional packings in dense 3‐uniform hypergraphs ⋮ A survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Integer and fractional packings of hypergraphs ⋮ Packing directed cycles efficiently ⋮ Packing and Covering a Given Directed Graph in a Directed Graph ⋮ Intersections of random hypergraphs and tournaments ⋮ Packing edge-disjoint triangles in regular and almost regular tournaments ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Voting Procedures, Complexity of ⋮ Maximum dispersion problem in dense graphs ⋮ Almost given length cycles in digraphs ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ An improved MST algorithm for ranking players of a round-robin tournament ⋮ Partitioning problems in dense hypergraphs ⋮ Packing Triangles in Regular Tournaments

This page was built for publication: Constructive Quasi-Ramsey Numbers and Tournament Ranking