Combinatorics

Problem
There are nine cities which are served by two competing airlines. One or the other airline (but not both) has flight between every pair of cities. What is the minimum number of possible triangular flights (i.e., trips from A to B to C and back to A on the same airline)?