Graphs whose every transitive orientation contains almost every relation

DOI10.1007/BF02779671zbMath0627.05037OpenAlexW2004621408MaRDI QIDQ581415

Béla Bollobás, Graham R. Brightwell

Publication date: 1987

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02779671

zbMATH Keywords

partial ordertransitive orientations

Mathematics Subject Classification ID

Partial orders, general (06A06) Random graphs (graph-theoretic aspects) (05C80) Total orders (06A05)

Related Items (3)

Sorting in rounds ⋮ Fast geometric approximation techniques and geometric embedding problems ⋮ Parallel comparison algorithms for approximation problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sorting in \(c \log n\) parallel steps
• Sorting in one round
• Parallel sorting
• Transitive Orientations of Graphs
• Parallel Sorting with Constant Time for Comparisons
• Sorting and Merging in Rounds

This page was built for publication: Graphs whose every transitive orientation contains almost every relation