Showing math.COShow all
2 papers · 1 filter
math.CO2026
Bipartite Turán problem on cographs
Jakob Paul Zimmermann
A cograph is a graph that contains no induced path on four vertices or equivalently a graph that can be constructed from vertices by sum and product operations. We study the…
math.CO2024
Induced Turán problem in bipartite graphs
Maria Axenovich, Jakob Zimmermann
The classical extremal function for a graph , is the largest number of edges in a subgraph of that contains no subgraph isomorphic to . Note that defining…