2 papers
math.CO2026
Balanced bipartite distance of -free graphs
József Balogh, Ignacy Buczek, Andrzej Grzesik +1
We show that every -free graph on vertices can be made balanced bipartite by removing at most edges. This proves a conjecture of Balogh, Clemen, and Lidick…
math.CO2025
Generalized Turán problem for directed cycles
Andrzej Grzesik, Justyna Jaworska, BartÅomiej Kielak +2
For integers , let denote the maximum number of directed cycles of length in any oriented graph…