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

12 papers

math.CO2024

Saturation in Random Hypergraphs

Sahar Diskin, Ilay Hoshen, Dániel Korándi +2

Let $K_{n}^{r}$ be the complete $r$ -uniform hypergraph on $n$ vertices, that is, the hypergraph whose vertex set is $[n] := {1, 2, ..., n}$ and whose edge set is $(r [ n ])$ . We form…

math.CO2022

Decomposing random permutations into order-isomorphic subpermutations

Carla Groenland, Tom Johnston, Dániel Korándi +3

Two permutations $s$ and $t$ are $k$ -similar if they can be decomposed into subpermutations $s^{1}, \dots, s^{k}$ and $t^{1}, \dots, t^{k}$ such that $s^{i}$ is order-isomorphic to $t^{i}$ f…

math.CO2019

Large homogeneous submatrices

Dániel Korándi, János Pach, István Tomon

A matrix is homogeneous if all of its entries are equal. Let $P$ be a $2 \times 2$ zero-one matrix that is not homogeneous. We prove that if an $n \times n$ zero-one matrix $A$ does…

math.CO2019

Covering graphs by monochromatic trees and Helly-type results for hypergraphs

Matija Bucić, Dániel Korándi, Benny Sudakov

How many monochromatic paths, cycles or general trees does one need to cover all vertices of a given $r$ -edge-coloured graph $G$ ? These problems were introduced in the 1960s and we…

math.CO2017★ 1 cited

Monochromatic cycle covers in random graphs

Dániel Korándi, Frank Mousset, Rajko Nenadov +2

A classic result of Erdős, Gyárfás and Pyber states that for every coloring of the edges of $K_{n}$ with $r$ colors, there is a cover of its vertex set by at most $f(r) = O(r^2 \log…

math.CO2017★ 1 cited

On the Turán number of ordered forests

Dániel Korándi, Gábor Tardos, István Tomon +1

An ordered graph $H$ is a simple graph with a linear order on its vertex set. The corresponding Turán problem, first studied by Pach and Tardos, asks for the maximum number $\text{…

math.CO2017

Rainbow saturation and graph capacities

Dániel Korándi

The $t$ -colored rainbow saturation number $r s a t_{t} (n, F)$ is the minimum size of a $t$ -edge-colored graph on $n$ vertices that contains no rainbow copy of $F$ , but the addition of an…

math.CO2017★ 10 cited

On the Turán number of some ordered even cycles

Ervin Győri, Dániel Korándi, Abhishek Methuku +3

A classical result of Bondy and Simonovits in extremal graph theory states that if a graph on $n$ vertices contains no cycle of length $2 k$ then it has at most $O (n^{1 + 1/ k})$ edges…

math.CO2016

Domination in 3-tournaments

Dániel Korándi, Benny Sudakov

A 3-tournament is a complete 3-uniform hypergraph where each edge has a special vertex designated as its tail. A vertex set $X$ dominates $T$ if every vertex not in $X$ is containe…

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…

math.CO2014★ 8 cited

Decomposing random graphs into few cycles and edges

Dániel Korándi, Michael Krivelevich, Benny Sudakov

Over 50 years ago, Erdős and Gallai conjectured that the edges of every graph on $n$ vertices can be decomposed into $O (n)$ cycles and edges. Among other results, Conlon, Fox and S…