Dániel József Korándi

This person is no longer with EPFL

About
Privacy
Disclaimer

Graph Chatbot

Related publications (6)

Covering Graphs by Monochromatic Trees and Helly-Type Results for Hypergraphs

Dániel József Korándi

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 were intensively studied by various researchers over the last 50 years. In this pa ...

SPRINGER HEIDELBERG2021

Improved Ramsey-type results for comparability graphs

Istvan Tomon, Dániel József Korándi

Several discrete geometry problems are equivalent to estimating the size of the largest homogeneous sets in graphs that happen to be the union of few comparability graphs. An important observation for such results is that if G is an n-vertex graph that is ...

CAMBRIDGE UNIV PRESS2020

On the Turan number of ordered forests

Gábor Tardos, Istvan Tomon, Dániel József Korándi

An ordered graph H is a simple graph with a linear order on its vertex set. The corresponding Turan problem, first studied by Pach and Tardos, asks for the maximum number ex(

ACADEMIC PRESS INC ELSEVIER SCIENCE2019

On the Turan number of some ordered even cycles

Istvan Tomon, Dániel József Korándi, Abhishek Methuku

2018

RAINBOW SATURATION AND GRAPH CAPACITIES

Dániel József Korándi

SIAM Publications2018

Monochromatic cycle covers in random graphs

Dániel József Korándi

A classic result of Erdos, Gyarfas 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(r2logr) vertex-disjoint monochromatic cycles. In particular, the minimum number of such cove ...

WILEY2018

Page 1 of 1