 Median order of a tournament

A median order maximizes the number of forward directed edges in a linear ordering of the vertices of a tournament. Every interval inherits a median order. Moving the first vertex of an interval to its end proves that it has at least as many outgoing as incoming edges in that interval; otherwise the move would increase the number of forward edges. Reversing all edges and the order gives the dual assertion for the last vertex.