Graphs whose every transitive orientation contains almost every relation

Authors

Béla Bollobás, Faculty of MathematicsFollow
Graham Brightwell, Faculty of MathematicsFollow

Abstract

Given a graph G on n vertices and a total ordering ≺ of V(G), the transitive orientation of G associated with ≺, denoted P(G; ≺), is the partial order on V(G) defined by setting x

Publication Title

Israel Journal of Mathematics

Recommended Citation

Bollobás, B., & Brightwell, G. (1987). Graphs whose every transitive orientation contains almost every relation. Israel Journal of Mathematics, 59 (1), 112-128. https://doi.org/10.1007/BF02779671