Yuval Wigderson

activity

20152026

most citedRamsey goodness of books revisited

9 citations · 29 across the 37 of their papers we have counts for

collaborators

Showing 2024Show all

9 papers · 1 filter

math.CO2024

Ordered Ramsey numbers of graphs with $m$ edges

Domagoj Bradač, Patryk Morawski, Benny Sudakov +1

Given a vertex-ordered graph $G$ , the ordered Ramsey number $r_{<} (G)$ is the minimum integer $N$ such that every $2$ -coloring of the edges of the complete ordered graph $K_{N}$ contai…

math.CO2024

Upper bounds on diagonal Ramsey numbers [after Campos, Griffiths, Morris, and Sahasrabudhe]

Yuval Wigderson

Ramsey's theorem states that if $N$ is sufficiently large, then no matter how one colors the edges among $N$ vertices with two colors, there are always $k$ vertices spanning edges…

math.CO2024

Canonical Ramsey numbers of sparse graphs

Lior Gishboliner, Aleksa Milojević, Benny Sudakov +1

The canonical Ramsey theorem of Erdős and Rado implies that for any graph $H$ , any edge-coloring (with an arbitrary number of colors) of a sufficiently large complete graph $K_{N}$ c…

math.CO2024

Infinitely many minimally non-Ramsey size-linear graphs

Yuval Wigderson

A graph $G$ is said to be Ramsey size-linear if $r (G, H) = O_{G} (e (H))$ for every graph $H$ with no isolated vertices. Erdős, Faudree, Rousseau, and Schelp observed that $K_{4}$ is not…

math.CO2024

Blowups of triangle-free graphs

António Girão, Zach Hunter, Yuval Wigderson

A highly influential result of Nikiforov states that if an $n$ -vertex graph $G$ contains at least $γ n^{h}$ copies of a fixed $h$ -vertex graph $H$ , then $G$ contains a blowup of $H$ o…

math.CO2024★ 1 cited

Counting subgraphs in locally dense graphs

Domagoj Bradač, Benny Sudakov, Yuval Wigderson

A graph $G$ is said to be $p$ -locally dense if every induced subgraph of $G$ with linearly many vertices has edge density at least $p$ . A famous conjecture of Kohayakawa, Nagle, Rö…

math.CO2024

Oriented Ramsey numbers of graded digraphs

Patryk Morawski, Yuval Wigderson

We show that any graded digraph $D$ on $n$ vertices with maximum degree $Δ$ has an oriented Ramsey number of at most $C^{Δ} n$ for some absolute constant $C > 1$ , improving upon a rec…

math.CO2024

Larger Nearly Orthogonal Sets over Finite Fields

Ishay Haviv, Sam Mattheus, Aleksa Milojević +1

For a field $F$ and integers $d$ and $k$ , a set $A \subseteq F^{d}$ is called $k$ -nearly orthogonal if its members are non-self-orthogonal and every $k + 1$ ve…

math.CO2024

Resolution of the Kohayakawa-Kreuter conjecture

Micha Christoph, Anders Martinsson, Raphael Steiner +1

A graph $G$ is said to be Ramsey for a tuple of graphs $(H_{1}, \dots, H_{r})$ if every $r$ -coloring of the edges of $G$ contains a monochromatic copy of $H_{i}$ in color $i$ , for some $i$ …

Ordered Ramsey numbers of graphs with m edges

Upper bounds on diagonal Ramsey numbers [after Campos, Griffiths, Morris, and Sahasrabudhe]

Canonical Ramsey numbers of sparse graphs

Infinitely many minimally non-Ramsey size-linear graphs

Blowups of triangle-free graphs

Counting subgraphs in locally dense graphs

Oriented Ramsey numbers of graded digraphs

Larger Nearly Orthogonal Sets over Finite Fields

Resolution of the Kohayakawa-Kreuter conjecture

Ordered Ramsey numbers of graphs with $m$ edges