Abstract
Let k(3, 4) be the least positive integer N such that every loopless oriented graph on N vertices contains an independent triple or a complete transitive tournament on four vertices. We give a computer-assisted proof that k(3, 4) = 21. A previously recorded cyclic graph supplies the lower bound. For the upper bound, elementary neighbourhood restrictions and an oddorder parity argument reduce a hypothetical graph on 21 vertices to 129 template cases. Eight checked classification refutations establish coverage of the local templates. A further 108 checked refutations, together with 21 explicit reversal transports, exclude every case. Acceptance of the certificates relies on a stricter LRAT checker: an independent computational audit found that the original deposited checker could accept an unsupported empty clause and replayed the entire selected corpus after correcting that defect. The proof retains an ordinary software and compiler trust boundary; it is not a proof-assistant formalization. We make no priority claim over an earlier assertion of the same value.