Walner Mendonça
Instituto Nacional de Matemática Pura e Aplicada
12 Papers
22 Citations
Walner Mendonça is an academic researcher from Instituto Nacional de Matemática Pura e Aplicada. The author has contributed to research in topics: Monochromatic color & Degree (graph theory). The author has an hindex of 3, co-authored 10 publications.
Chat about Author
Papers
The size-Ramsey number of powers of bounded degree trees
Sören Berger,Yoshiharu Kohayakawa,Giulia Satiko Maesaka,Taísa Martins,Walner Mendonça,Guilherme Oliveira Mota,Olaf Parczyk +6 more
TL;DR: The size Ramsey number of graphs with bounded treewidth and bounded degree was shown to be linear in this article for any positive integer k and positive integer s, where k is the number of vertices in a tree.
18
The size-Ramsey number of powers of bounded degree trees
Sören Berger,Yoshiharu Kohayakawa,Giulia Satiko Maesaka,Taísa Martins,Walner Mendonça,Guilherme Oliveira Mota,Olaf Parczyk +6 more
TL;DR: The size Ramsey number of graphs with bounded treewidth and bounded degree was shown to be linear in this paper for any positive integer k and positive integer s, where k is the number of vertices in a tree.
13
•Posted Content
Asymmetric Ramsey Properties of Random Graphs for Cliques and Cycles
TL;DR: For every pair of cycles and cliques, the Kohayakawa-Kreuter conjecture has been shown to be true for the first time in this article, where the authors show that the threshold for the property $G(n,p) \to (F,H)$ is equal to (n − 1/m 2+1/m_2(H), where m 2 is the number of cliques.
5
The size-ramsey number of powers of bounded degree trees
Sören Berger,Yoshiharu Kohayakawa,Giulia Satiko Maesaka,Taísa Martins,Walner Mendonça,Guilherme Oliveira Mota,Olaf Parczyk +6 more
- 26 Jul 2019
TL;DR: The size Ramsey number of graphs with bounded treewidth and bounded degree was shown to be linear in this article for any positive integer k and positive integer s, where k is the number of vertices in a tree.
•Posted Content
Covering $3$-edge-coloured random graphs with monochromatic trees
TL;DR: It is shown that for any $3$-edge-colouring of the random graph G(n,p) the authors can find three monochromatic trees such that their union covers all vertices, which improves, for three colours, a result of Bucic, Korandi and Sudakov.
2