Wojciech Samotij

most citedOn the number of monotone sequences

3 citations · 5 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2023★ 1 cited

Simonovits's theorem in random graphs

Ilay Hoshen, Wojciech Samotij

Let $H$ be a graph with $χ (H) = r + 1$ . Simonovits's theorem states that, if $H$ is edge-critical, the unique largest $H$ -free subgraph of $K_{n}$ is its largest $r$ -partite subgraph,…

math.CO2023★ 1 cited

On the Kohayakawa-Kreuter conjecture

Eden Kuperwasser, Wojciech Samotij, Yuval Wigderson

Let us say that a graph $G$ is Ramsey for a tuple $(H_{1}, \dots, H_{r})$ of graphs if every $r$ -coloring of the edges of $G$ contains a monochromatic copy of $H_{i}$ in color $i$ , for som…

math.CO2014★ 3 cited

On the number of monotone sequences

Wojciech Samotij, Benny Sudakov

One of the most classical results in Ramsey theory is the theorem of Erdős and Szekeres from 1935, which says that every sequence of more than $k^{2}$ numbers contains a monotone sub…