We stand with Ukraine  

Dániel Korándi

Orcid: 0000-0002-3975-0787

According to our database1, Dániel Korándi authored at least 15 papers between 2015 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Decomposing Random Permutations into Order-Isomorphic Subpermutations.
[BibTeX]
[DOI]
Carla Groenland
,
Tom Johnston
,
Dániel Korándi
,
Alexander Roberts
,
Alex D. Scott
,
Jane Tan
SIAM J. Discret. Math., June, 2023

2021
Minimum degree conditions for monochromatic cycle partitioning.
[BibTeX]
[DOI]
Dániel Korándi
,
Richard Lang
,
Shoham Letzter
,
Alexey Pokrovskiy
J. Comb. Theory B, 2021

Powers of paths in tournaments.
[BibTeX]
[DOI]
Nemanja Draganic
,
François Dross
,
Jacob Fox
,
António Girão
,
Frédéric Havet
,
Dániel Korándi
,
William Lochet
,
David Munhá Correia
,
Alex D. Scott
,
Benny Sudakov
Comb. Probab. Comput., 2021

Covering Graphs by Monochromatic Trees and Helly-Type Results for Hypergraphs.
[BibTeX]
[DOI]
Matija Bucic
,
Dániel Korándi
,
Benny Sudakov
Comb., 2021

2020
Large Homogeneous Submatrices.
[BibTeX]
[DOI]
Dániel Korándi
,
János Pach
,
István Tomon
SIAM J. Discret. Math., 2020

Improved Ramsey-type results for comparability graphs.
[BibTeX]
[DOI]
Dániel Korándi
,
István Tomon
Comb. Probab. Comput., 2020

2019
On the Turán number of ordered forests.
[BibTeX]
[DOI]
Dániel Korándi
,
Gábor Tardos
,
István Tomon
,
Craig Weidert
J. Comb. Theory A, 2019

2018
Rainbow Saturation and Graph Capacities.
[BibTeX]
[DOI]
Dániel Korándi
SIAM J. Discret. Math., 2018

Monochromatic cycle covers in random graphs.
[BibTeX]
[DOI]
Dániel Korándi
,
Frank Mousset
,
Rajko Nenadov
,
Nemanja Skoric
,
Benny Sudakov
Random Struct. Algorithms, 2018

On the Turán number of some ordered even cycles.
[BibTeX]
[DOI]
Ervin Györi
,
Dániel Korándi
,
Abhishek Methuku
,
István Tomon
,
Casey Tompkins
,
Máté Vizer
Eur. J. Comb., 2018

2017
Saturation in random graphs.
[BibTeX]
[DOI]
Dániel Korándi
,
Benny Sudakov
Random Struct. Algorithms, 2017

Domination in 3-tournaments.
[BibTeX]
[DOI]
Dániel Korándi
,
Benny Sudakov
J. Comb. Theory A, 2017

2015
A random triadic process.
[BibTeX]
[DOI]
Dániel Korándi
,
Yuval Peled
,
Benny Sudakov
Electron. Notes Discret. Math., 2015

K<sub>s, t</sub>-saturated bipartite graphs.
[BibTeX]
[DOI]
Wenying Gan
,
Dániel Korándi
,
Benny Sudakov
Eur. J. Comb., 2015

Decomposing Random Graphs into Few Cycles and Edges.
[BibTeX]
[DOI]
Dániel Korándi
,
Michael Krivelevich
,
Benny Sudakov
Comb. Probab. Comput., 2015


  Loading...