Abstract
This entry formalizes the classical Földes–Hammer theorem characterizing finite split graphs as exactly the graphs with no induced copy of \(2K_2\), \(C_4\), or \(C_5\). It builds on the AFP session
Undirected_Graph_Theory.License
Note
Codex with gpt 5.5 on xhigh reasoning was used to help with proof engineering.