15 citations · 83 across the 30 of their papers we have counts for
5 papers · 1 filter
The multicolour size-Ramsey number of powers of paths
Jie Han, Matthew Jenssen, Yoshiharu Kohayakawa +2
Given a positive integer , a graph is -Ramsey for a graph , denoted , if every -colouring of the edges of contains a monochromatic copy of $…
Counting restricted orientations of random graphs
Maurício Collares, Yoshiharu Kohayakawa, Robert Morris +1
We count orientations of avoiding certain classes of oriented graphs. In particular, we study , the number of orientations of the binomial random graph …
Counting Gallai 3-colorings of complete graphs
Josefran de Oliveira Bastos, Fabricio Siqueira Benevides, Guilherme Oliveira Mota +1
An edge coloring of the n-vertex complete graph K_n is a Gallai coloring if it does not contain any rainbow triangle, that is, a triangle whose edges are colored with three distinc…
Three-colour bipartite Ramsey number for graphs with small bandwidth
Guilherme Oliveira Mota
We estimate the -colour bipartite Ramsey number for balanced bipartite graphs with small bandwidth and bounded maximum degree. More precisely, we show that the minimum value…
Powers of tight Hamilton cycles in randomly perturbed hypergraphs
Wiebke Bedenknecht, Jie Han, Yoshiharu Kohayakawa +1
For and such that , we prove that, for any , there exists such that the union of an -vertex -graph with minimum codegree $\left(1-\bino…