Andrzej Grzesik

most citedThe Turán number of blow-ups of trees

2 citations · 2 across the 1 of their papers we have counts for

collaborators

4 papers

cs.DM2020

Covering minimal separators and potential maximal cliques in $P_{t}$ -free graphs

Andrzej Grzesik, Tereza Klimošová, Marcin Pilipczuk +1

A graph is called $P_{t}$ -free} if it does not contain a $t$ -vertex path as an induced subgraph. While $P_{4}$ -free graphs are exactly cographs, the structure of $P_{t}$ -free graphs for…

math.CO2019

Maximal edge colorings of graphs

Sebastian Babiński, Andrzej Grzesik

For a graph $G$ of order $n$ a maximal edge coloring is a proper edge coloring with $χ^{'} (K_{n})$ colors such that adding any edge to $G$ in any color makes it improper. Meszka and Tyn…

math.CO2019★ 2 cited

The Turán number of blow-ups of trees

Andrzej Grzesik, Oliver Janzer, Zoltán Lóránt Nagy

A conjecture of Erdős from 1967 asserts that any graph on $n$ vertices which does not contain a fixed $r$ -degenerate bipartite graph $F$ has at most $C n^{2 - 1/ r}$ edges, where $C$ i…

math.CO2019

Cycles of length three and four in tournaments

Timothy F. N. Chan, Andrzej Grzesik, Daniel Kral +1

Linial and Morgenstern conjectured that, among all $n$ -vertex tournaments with $d (3 n)$ cycles of length three, the number of cycles of length four is asymptotically minimiz…

Covering minimal separators and potential maximal cliques in Pt​-free graphs

Maximal edge colorings of graphs

The Turán number of blow-ups of trees

Cycles of length three and four in tournaments

Covering minimal separators and potential maximal cliques in $P_{t}$ -free graphs