Claims

../

1990_12_01_tuza: Theorem 2(a) of Tuza (Discrete Math. 1990) proves that every chordal graph on n vertices has a clique transversal of at most n/2 vertices, which gives the inequality for chordal graphs; accepted on the refereed paper.

2026_09_28_veljjanoski: A write-up of 28 September 2026 claims the Erdős–Gallai clique-transversal inequality for every graph on at most 39 vertices, by a minimum-counterexample reduction and a new Euler-circuit argument; unreviewed, so claimed.

---