Wojciech Samotij

activity

20242026

collaborators

5 papers

math.CO2026

Entropy methods in combinatorics

Wojciech Samotij

Even though entropy methods have been used in combinatorics for at least five decades, only in recent years has their use really proliferated. There are now tens, if not hundreds,…

math.CO2026

Two-round Ramsey games on random graphs

Yahav Alon, Patrick Morris, Wojciech Samotij

Motivated by the investigation of sharpness of thresholds for Ramsey properties in random graphs, Friedgut, Kohayakawa, RÃ¶dl, RuciÅski and Tetali introduced two variants of a sin…

math.PR2026

Upper tails for irregular graphs beyond the mean-field regime

Asaf Cohen Antonir, Matan Harel, Frank Mousset +1

Let $G_{n, p}$ be the binomial random graph of density $p$ and let $X_{H}$ be the number of copies of a fixed graph $H$ in $G_{n, p}$ . We prove asymptotically tight bounds on the logar…

math.CO2025

On the edge expansion of random polytopes

Asaf Ferber, Michael Krivelevich, Marcelo Sales +1

A $0/1$ -polytope in $R^{n}$ is the convex hull of a subset of ${0, 1}^{n}$ . The graph of a polytope $P$ is the graph whose vertices are the zero-dimensional faces of $P$ and…

math.CO2024

The list-Ramsey threshold for families of graphs

Eden Kuperwasser, Wojciech Samotij

Given a family of graphs $F$ and an integer $r$ , we say that a graph is $r$ -Ramsey for $F$ if any $r$ -colouring of its edges admits a monochromatic copy of a gr…