Chain Graphs have Unbounded Readability

Martin Charles Golumbic, Uri N. Peled, Udi Rotics

A triangle-free graph $G$ is called read-$k$ when there exists a monotone Boolean formula $\varphi$ whose variables are the vertices of $G$ and whose minterms are precisely the edges of…