Chains and unique transitive orientations of prime graphs

RESUMO

We give a short, conceptual proof that prime graphs have at most two transitive orientations, a much-quoted result of Gallai. Our proof uses chains, introduced by Chudnovsky, Kim, Oum, and Seymour, which provide a transparent characterization of primality. Transitivity induces a forcing relation on edges; using chains, we show that any two edges of a prime graph are equivalent under this relation, and thus any transitive orientation is unique up to reversal.