4 citations · 6 across the 3 of their papers we have counts for
4 papers
Ramsey-type numbers involving graphs and hypergraphs with large girth
H. Hàn, T. Retter, V. Rödl +1
A question of Erdős asks if for every pair of positive integers and , there exists a graph having and the property that every -colouring of the…
Increasing paths in edge-ordered graphs: the hypercube and random graphs
Jessica De Silva, Theodore Molla, Florian Pfender +2
An edge-ordering of a graph is a bijection . Given an edge-ordering, a sequence of edges is an increasing path if it is a path…
The game chromatic number of trees and forests
Charles Dunn, Victor Larsen, Kira Lindke +2
While the game chromatic number of a forest is known to be at most 4, no simple criteria are known for determining the game chromatic number of a forest. We first state necessary a…
On generalized Ramsey numbers of Erdős and Rogers
Andrzej Dudek, Troy Retter, Vojta Rödl
Extending the concept of Ramsey numbers, Erd{\H o}s and Rogers introduced the following function. For given integers let $$ f_{s,t}(n)=\min \{\max \{|W| : W\subseteq V(G…