Dániel Korándi

activity

20142024

most citedOn the Turán number of some ordered even cycles

10 citations · 21 across the 8 of their papers we have counts for

collaborators

Showing 2015 · math.COShow all

2 papers · 2 filters

math.CO2015

Saturation in random graphs

Dániel Korándi, Benny Sudakov

A graph $H$ is $K_{s}$ -saturated if it is a maximal $K_{s}$ -free graph, i.e., $H$ contains no clique on $s$ vertices, but the addition of any missing edge creates one. The minimum numb…

math.CO2015★ 1 cited

A random triadic process

Dániel Korándi, Yuval Peled, Benny Sudakov

Given a random 3-uniform hypergraph $H = H (n, p)$ on $n$ vertices where each triple independently appears with probability $p$ , consider the following graph process. We start with the…