15 citations · 83 across the 30 of their papers we have counts for
4 papers · 1 filter
Factors in randomly perturbed hypergraphs
Yulin Chang, Jie Han, Yoshiharu Kohayakawa +2
We determine, up to a multiplicative constant, the optimal number of random edges that need to be added to a -graph with minimum vertex degree to ensure an -…
Covering -edge-coloured random graphs with monochromatic trees
Yoshiharu Kohayakawa, Walner Mendonça, Guilherme Oliveira Mota +1
We investigate the problem of determining how many monochromatic trees are necessary to cover the vertices of an edge-coloured random graph. More precisely, we show that for $p\gg…
Anti-Ramsey threshold of cycles
Gabriel Ferreira Barros, Bruno Pasqualotto Cavalar, Guilherme Oliveira Mota +1
For graphs and , let denote the property that for every proper edge colouring of there is a rainbow copy of in . Exte…
Counting graph orientations with no directed triangles
Pedro Araújo, Fábio Botler, Guilherme Oliveira Mota
Alon and Yuster proved that the number of orientations of any -vertex graph in which every is transitively oriented is at most for …