Patryk Morawski

activity

20242026

collaborators

5 papers

math.CO2026

Nearly tight bounds for induced subdivisions

Zach Hunter, Aleksa MilojeviÄ, Patryk Morawski +1

Subdivisions of complete graphs play a central role in combinatorics, having deep connections to structural, extremal, and topological aspects of graph theory. A celebrated conject…

math.CO2026

Ramsey number of a cycle versus a graph of a given size

Stijn Cambie, Andrea Freschi, Patryk Morawski +2

In this paper, we prove that for every $k$ and every graph $H$ with $m$ edges and no isolated vertices, the Ramsey number $R (C_{k}, H)$ is at most $2 m + ⌊ \frac{k - 1}{2} ⌋$ ,…

math.CO2025

Ramsey numbers of digraphs with local edge structure

Domagoj BradaÄ, Patryk Morawski, Benny Sudakov +1

One of the classical topics in graph Ramsey theory is the study of which $n$ -vertex graphs have Ramsey numbers that are linear in $n$ . In this paper, we consider this problem in th…

math.CO2025

Hamilton cycles in regular graphs perturbed by a random 2-factor

Cicely, Henderson, Sean Longbrake +2

In this paper, we prove that for each $d \geq 2$ , the union of a $d$ -regular graph with a uniformly random $2$ -factor on the same vertex set is Hamiltonian with high probability. T…

math.CO2024

Ordered Ramsey numbers of graphs with $m$ edges