Andrzej Grzesik

activity

20112026

most citedElusive extremal graphs

8 citations · 27 across the 30 of their papers we have counts for

collaborators

Showing 2026Show all

4 papers · 1 filter

math.CO2026

Proof of the mad conjecture and its coloring applications

Andrzej Grzesik, Lenka Kopfová, Gaurav Kucheriya +2

For a finite graph $G$ , the maximum average degree $mad (G)$ is the largest average degree of a nonempty subgraph of $G$ . Hendrey, Norin and Wood asked whether this p…

math.CO2026

Maximizing $K_{r} + I_{r}$ in graphs with fixed edge density

József Balogh, Andrzej Grzesik, Bernard Lidický +3

For every integer $r \geq 4$ , and $ρ \in [0, 1]$ , we asymptotically determine the maximum proportion of $r$ -element sets of vertices that induce either a clique or an independent set in…

math.CO2026

Rainbow Turán numbers for paths of length four

Sylwia Antoniuk, Andrzej Grzesik, Magdalena Prorok +1

Given a set $V$ of $n$ vertices and an integer $k \geq 1$ , our goal is to maximize the number of edges in graphs $G_{1}, G_{2}, \dots, G_{k}$ , defined on $V$ , under the constraint that the…

math.CO2026

Balanced bipartite distance of $K_{4}$ -free graphs

József Balogh, Ignacy Buczek, Andrzej Grzesik +1

We show that every $K_{4}$ -free graph on $n$ vertices can be made balanced bipartite by removing at most $\frac{n ^{2}}{9}$ edges. This proves a conjecture of Balogh, Clemen, and Lidick…

Proof of the mad conjecture and its coloring applications

Maximizing Kr​+Ir​ in graphs with fixed edge density

Rainbow Turán numbers for paths of length four

Balanced bipartite distance of K4​-free graphs

Maximizing $K_{r} + I_{r}$ in graphs with fixed edge density

Balanced bipartite distance of $K_{4}$ -free graphs