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.
SIAM J. Discret. Math., June, 2023

2021
Minimum degree conditions for monochromatic cycle partitioning.
J. Comb. Theory, Ser. B, 2021

Powers of paths in tournaments.
Comb. Probab. Comput., 2021

Covering Graphs by Monochromatic Trees and Helly-Type Results for Hypergraphs.
Comb., 2021

2020
Large Homogeneous Submatrices.
SIAM J. Discret. Math., 2020

Improved Ramsey-type results for comparability graphs.
Comb. Probab. Comput., 2020

2018
Rainbow Saturation and Graph Capacities.
SIAM J. Discret. Math., 2018

Monochromatic cycle covers in random graphs.
Random Struct. Algorithms, 2018

On the Turán number of some ordered even cycles.
Eur. J. Comb., 2018

2017
Saturation in random graphs.
Random Struct. Algorithms, 2017

Domination in 3-tournaments.
J. Comb. Theory, Ser. A, 2017

On the Turán number of ordered forests.
Electron. Notes Discret. Math., 2017

2015
A random triadic process.
Electron. Notes Discret. Math., 2015

K<sub>s, t</sub>-saturated bipartite graphs.
Eur. J. Comb., 2015

Decomposing Random Graphs into Few Cycles and Edges.
Comb. Probab. Comput., 2015


  Loading...