collaborators

6 papers

math.CO2026

Cycle lengths in graphs of given minimum degree

Yandong Bai, Andrzej Grzesik, Binlong Li +1

We prove that if is a 2-connected graph with minimum degree at least , then (1) contains cycles whose lengths form an arithmetic progression with common d…

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

Strong modeling limits of graphs with bounded tree-width

Andrzej Grzesik, Daniel Kráľ, Samuel Mohr

The notion of first order convergence of graphs unifies the notions of convergence for sparse and dense graphs. NeÅ¡etřil and Ossona de Mendez [J. Symbolic Logic 84 (2019), 452-47…

math.CO2025

Subgraphs with a positive minimum semidegree in digraphs with large outdegree

Andrzej Grzesik, Vojtech Rodl, Jan Volec

We prove that every -vertex directed graph with the minimum outdegree contains a subgraph satisfying \[ \min\left\{δ^+(H), δ^-(H) \right\} \ge \frac{d(d+…

math.CO2025

Antidirected paths in oriented graphs

Andrzej Grzesik, Marek Skrzypczyk

We show that for any integer , every oriented graph with minimum semidegree bigger than contains an antidirected path of length . Conseque…

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…