2 problems

Let $d4a4_k$ be the countable universal homogeneous $k$-clique-free graph, and let $d4a2$ be a finite $k$-clique-free graph. Suppose that the currently missing lower bounds for the…

Let $d4a4_k$ be the countable universal homogeneous $k$-clique-free graph, and let $d4a2$ be a finite $k$-clique-free graph. An incremental antichain of coding nodes is an antichai…