4 citations · 4 across the 1 of their papers we have counts for
2 papers
math.CO2016
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…
math.CO2015★ 4 cited
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…