This interactive visualization tool presents edge-maximal Ks,t-free cographs, computed via dynamic programming on the lattice of biclique-profiles.
A master project by Jakob Paul Zimmermann.
Bipartite Turán problem on cographs arXiv:2601.07406, January 2026
github.com/JayPiZimmermann/zarankievicz_cographs
This interactive visualization tool presents extremal Ks,t-free cographs on n vertices, computed via dynamic programming on the lattice of biclique-profiles.
No graph selected