Send your message by email

Advanced search

Ministério da Educação (Brasil). Universidade Federal do ABC (UFABC). Centro de Matemática, Computação e Cognição (CMCC)
(Institutional affiliation for the last research proposal)

Birthplace:
Brazil

Professor Doutor da Universidade de São Paulo (USP). Possui doutorado em Ciência da Computação pela USP, sob a orientação de Yoshiharu Kohayakawa, e realizou pós-doutorados na USP (Computação), na Universidade de Hamburgo (Matemática) e na Universidade Técnica de Hamburg-Harburg (Matemática). Atua nas áreas de Teoria da Computação e Combinatória, principalmente nos seguintes temas: Teoria de Ramsey, Colorações em Grafos, Decomposição de Grafos e Métodos Probabilísticos. (Source: Lattes Curriculum)

Research grants

- Ramsey theory, structural graph theory and applications in Bioinformatics, AP.JP
### Abstract

This is the research project for the young investigators in emerging institutions grants to be developed in the Centro de Matemática, Computação e Cognição (CMCC) of Universidade Federal do ABC (UFABC) from 1/8/2018 to 31/7/2022 (48 months). The Computer Science is is present in many areas of knowledge, so the need to deal with increasingly complex problems requires the development of n...

Scholarships in Brazil

- Partitioning random graphs into monochromatic copies, BP.MS
### Abstract

Bal and DeBiasio presented a conjecture with respect to a threshold for the following Ramsey-type property for graphs G: in every edge-colouring of G with r colours, there exist r disjoint monochromatic trees that partition the vertex-set of G. Recently it was proved that for 2 colours, the threshold for this property is given by ((\log n)/n)^{1/2}.In this project, we will study this re...

- Threshold functions for anti-Ramsey properties, BP.MS
### Abstract

Given an edge-coloring of the edges of a graph G, we say that a copy of H in G is rainbow if there are no two edges of H with the same color. In this project we are interested in making an advanced study and obtain advances on the investigation of the following graph property, known as anti-Ramsey property: for any coloring of the edges of G there exists a rainbow copy of H in G, i.e., ...

- Ramsey and anti-Ramsey structures in deterministic and random graphs, BP.DR
### Abstract

This is the project for the PhD of Paulo Matias da Silva Junior supervised by Professor Guilherme Oliveira Mota, at the Centro de Matemática, Computação e Cognição, UFABC, from 11/2/2019 to 10/8/2022 (3 and a half years, including an internship of six months abroad). This project focuses on the study of Ramsey, anti-Ramsey and size-Ramsey properties of random and deterministic graphs. T...

(Only some records are available in English at this moment)

- Comparison of motifs detection methods in biological networks, BP.IC
### Abstract

Algorithms to identify and find motifs include accurate counting and approximation algorithms. For efficient detection of motifs, several approximation algorithms have been developed. Given the variety of existing algorithms for finding motifs in biological networks, in this project we aim to perform a comparative analysis of several algorithms for detecting motifs, which are small conn...

- Extremal and probabilistic combinatorics, BP.PD
### Abstract

This is the research project to the postdoc of Guilherme Oliveira Mota, to be developed under the supervision of Y.~Kohayakawa, at the "Instituto de Matemática e Esatística", USP, from 1/9/2013 to 31/8/2015. This project is focused on achieving significant advances in several problems of the area of extremal and probabilistic combinatorics. The subjects of the problems that will be atta...

- Asymptotic combinatorics of sparse structures and regularity, BP.DR
### Abstract

This is the research proposal for the doctoral work of Guilherme Oliveira Mota, who will be supervised by Y. Kohayakawa, at the Instituto de Matemática e Estatística, Universidade de São Paulo, from July 2009 to December 2012 (including a six-month stay abroad). This proposal focuses on the asymptotic study of sparse combinatorial structures. This investigation will be based on Szemeréd...

Scholarships abroad

- Extremal and probabilistic combinatorics, BE.EP.PD
### Abstract

This is the research project for Guilherme Oliveira Mota, a postdoctoral student under the supervision of Y. Kohayakawa at the Instituto de Matemática e Estatística (USP) and a scholar of FAPESP (Proc. 2013/11431-2), to spend twelve months of his postdoctoral studies with research groups at Hamburg Universität. His stay is planned for the period of 01/12/2014 to 30/11/2015. The research...

- Asymptotic combinatorics of sparse structures and regularity, BE.EP.DR
### Abstract

This is the research project for Guilherme Oliveira Mota, a doctoral student under the supervision of Y. Kohayakawa at the Instituto de Matemática e Estatística (USP) and a scholar of FAPESP (Proc. 2009/06294-0), to spend five months of his doctoral studies with research groups at TU Munich. His stay is planned for the period of 01/11/2012 to 28/03/2013 (5 months). The researcher who ...

1 /
1
| Ongoing research grants |

1 /
1
| Completed research grants |

4 /
4
| Ongoing scholarships in Brazil |

3 /
3
| Completed scholarships in Brazil |

2 /
2
| Completed scholarships abroad |

11 /
11
| All research grants and scholarships |

Associated processes |

(References retrieved automatically from Web of Science and SciELO through information on FAPESP grants and their corresponding numbers as mentioned in the publications by the authors)

Publications | 22 |

Citations | 28 |

Cit./Article | 1.3 |

Data from Web of Science |

CLEMENS, DENNIS; JENSSEN, MATTHEW; KOHAYAKAWA, YOSHIHARU; MORRISON, NATASHA; MOTA, GUILHERME OLIVEIRA; REDING, DAMIAN; ROBERTS, BARNABY. The size-Ramsey number of powers of paths.** JOURNAL OF GRAPH THEORY**, v. 91, n. 3, p. 290-299, JUL 2019. Web of Science Citations: 0. (13/11431-2, 18/04876-1, 13/03447-6)

BEDENKNECHT, WIEBKE; MOTA, GUILHERME OLIVEIRA; REIHER, CHRISTIAN; SCHACHT, MATHIAS. On the local density problem for graphs of given odd-girth.** JOURNAL OF GRAPH THEORY**, v. 90, n. 2, p. 137-149, FEB 2019. Web of Science Citations: 0. (13/03447-6, 13/11431-2, 13/20733-2)

BASTOS, JOSEFRAN DE OLIVEIRA; MOTA, GUILHERME OLIVEIRA; SCHACHT, MATHIAS; SCHNITZER, JAKOB; SCHULENBURG, FABIAN. LOOSE HAMILTONIAN CYCLES FORCED BY LARGE (k-2)-DEGREE-APPROXIMATE VERSION.** SIAM JOURNAL ON DISCRETE MATHEMATICS**, v. 31, n. 4, p. 2328-2347, 2017. Web of Science Citations: 3. (13/11431-2, 13/20733-2)

BEDENKNECHT, WIEBKE; HAN, JIE; KOHAYAKAWA, YOSHIHARU; MOTA, GUILHERME O.. Powers of tight Hamilton cycles in randomly perturbed hypergraphs.** RANDOM STRUCTURES & ALGORITHMS**, v. 55, n. 4, JULY 2019. Web of Science Citations: 2. (13/03447-6, 18/04876-1, 14/18641-5)

BOTLER, F.; MOTA, G. O.; WAKABAYASHI, Y.. Decompositions of triangle-free 5-regular graphs into paths of length five.** DISCRETE MATHEMATICS**, v. 338, n. 11, p. 1845-1855, NOV 6 2015. Web of Science Citations: 4. (13/11431-2, 13/20733-2, 11/08033-0, 14/01460-8)

KOHAYAKAWA, Y.; KONSTADINIDIS, P. B.; MOTA, G. O.. On an anti-Ramsey threshold for sparse graphs with one triangle.** JOURNAL OF GRAPH THEORY**, v. 87, n. 2, p. 176-187, FEB 2018. Web of Science Citations: 1. (13/03447-6, 13/11431-2, 13/07699-0, 09/06294-0, 13/20733-2)

BOTLER, F.; MOTA, G. O.; OSHIRO, M. T. I.; WAKABAYASHI, Y.. Decomposing highly edge-connected graphs into paths of any given length.** JOURNAL OF COMBINATORIAL THEORY SERIES B**, v. 122, p. 508-542, JAN 2017. Web of Science Citations: 7. (13/03447-6, 13/11431-2, 11/08033-0, 14/01460-8, 13/20733-2)

KOHAYAKAWA, YOSHIHARU; MOTA, GUILHERME OLIVEIRA; SCHACHT, MATHIAS; TARAZ, ANUSCH. Counting results for sparse pseudorandom hypergraphs I.** EUROPEAN JOURNAL OF COMBINATORICS**, v. 65, p. 276-287, OCT 2017. Web of Science Citations: 1. (13/03447-6, 13/11431-2, 13/07699-0, 09/06294-0, 13/20733-2)

KOHAYAKAWA, YOSHIHARU; MOTA, GUILHERME OLIVEIRA; SCHACHT, MATHIAS; TARAZ, ANUSCH. Counting results for sparse pseudorandom hypergraphs II.** EUROPEAN JOURNAL OF COMBINATORICS**, v. 65, p. 288-301, OCT 2017. Web of Science Citations: 1. (13/03447-6, 13/11431-2, 13/07699-0, 13/20733-2)

COLLARES, MAURICIO; KOHAYAKAWA, YOSHIHARU; MORRIS, ROBERT; MOTA, GUILHERME O.. Counting restricted orientations of random graphs.** RANDOM STRUCTURES & ALGORITHMS**, v. 56, n. 4, p. 1016-1030, JUL 2020. Web of Science Citations: 0. (13/03447-6, 18/04876-1)

BASTOS, JOSEFRAN DE OLIVEIRA; MOTA, GUILHERME OLIVEIRA; SCHACHT, MATHIAS; SCHNITZER, JAKOB; SCHULENBURG, FABIAN. LOOSE HAMILTONIAN CYCLES FORCED BY LARGE (k-2)-DEGREE - SHARP VERSION.** CONTRIBUTIONS TO DISCRETE MATHEMATICS**, v. 13, n. 2, p. 88-100, 2018. Web of Science Citations: 0. (13/11431-2, 18/04876-1, 13/20733-2)

BEDENKNECHT, WIEBKE; HAN, JIE; KOHAYAKAWA, YOSHIHARU; MOTA, GUILHERME O.. Powers of tight Hamilton cycles in randomly perturbed hypergraphs.** RANDOM STRUCTURES & ALGORITHMS**, v. 55, n. 4, JULY 2019. Web of Science Citations: 2. (13/03447-6, 18/04876-1, 14/18641-5)

COLLARES, MAURICIO; KOHAYAKAWA, YOSHIHARU; MORRIS, ROBERT; MOTA, GUILHERME O.. Counting restricted orientations of random graphs.** RANDOM STRUCTURES & ALGORITHMS**, v. 56, n. 4, p. 1016-1030, JUL 2020. Web of Science Citations: 0. (13/03447-6, 18/04876-1)

KOHAYAKAWA, YOSHIHARU; MOTA, GUILHERME OLIVEIRA; SCHACHT, MATHIAS; TARAZ, ANUSCH. Counting results for sparse pseudorandom hypergraphs I.** EUROPEAN JOURNAL OF COMBINATORICS**, v. 65, p. 276-287, OCT 2017. Web of Science Citations: 1. (13/03447-6, 13/11431-2, 13/07699-0, 09/06294-0, 13/20733-2)

KOHAYAKAWA, YOSHIHARU; MOTA, GUILHERME OLIVEIRA; SCHACHT, MATHIAS; TARAZ, ANUSCH. Counting results for sparse pseudorandom hypergraphs II.** EUROPEAN JOURNAL OF COMBINATORICS**, v. 65, p. 288-301, OCT 2017. Web of Science Citations: 1. (13/03447-6, 13/11431-2, 13/07699-0, 13/20733-2)

CLEMENS, DENNIS; JENSSEN, MATTHEW; KOHAYAKAWA, YOSHIHARU; MORRISON, NATASHA; MOTA, GUILHERME OLIVEIRA; REDING, DAMIAN; ROBERTS, BARNABY. The size-Ramsey number of powers of paths.** JOURNAL OF GRAPH THEORY**, v. 91, n. 3, p. 290-299, JUL 2019. Web of Science Citations: 0. (13/11431-2, 18/04876-1, 13/03447-6)

BEDENKNECHT, WIEBKE; MOTA, GUILHERME OLIVEIRA; REIHER, CHRISTIAN; SCHACHT, MATHIAS. On the local density problem for graphs of given odd-girth.** JOURNAL OF GRAPH THEORY**, v. 90, n. 2, p. 137-149, FEB 2019. Web of Science Citations: 0. (13/03447-6, 13/11431-2, 13/20733-2)

BASTOS, JOSEFRAN DE OLIVEIRA; MOTA, GUILHERME OLIVEIRA; SCHACHT, MATHIAS; SCHNITZER, JAKOB; SCHULENBURG, FABIAN. LOOSE HAMILTONIAN CYCLES FORCED BY LARGE (k-2)-DEGREE-APPROXIMATE VERSION.** SIAM JOURNAL ON DISCRETE MATHEMATICS**, v. 31, n. 4, p. 2328-2347, 2017. Web of Science Citations: 3. (13/11431-2, 13/20733-2)

BOTLER, F.; MOTA, G. O.; WAKABAYASHI, Y.. Decompositions of triangle-free 5-regular graphs into paths of length five.** DISCRETE MATHEMATICS**, v. 338, n. 11, p. 1845-1855, NOV 6 2015. Web of Science Citations: 4. (13/11431-2, 13/20733-2, 11/08033-0, 14/01460-8)

KOHAYAKAWA, Y.; KONSTADINIDIS, P. B.; MOTA, G. O.. On an anti-Ramsey threshold for sparse graphs with one triangle.** JOURNAL OF GRAPH THEORY**, v. 87, n. 2, p. 176-187, FEB 2018. Web of Science Citations: 1. (13/03447-6, 13/11431-2, 13/07699-0, 09/06294-0, 13/20733-2)

BOTLER, F.; MOTA, G. O.; OSHIRO, M. T. I.; WAKABAYASHI, Y.. Decomposing highly edge-connected graphs into paths of any given length.** JOURNAL OF COMBINATORIAL THEORY SERIES B**, v. 122, p. 508-542, JAN 2017. Web of Science Citations: 7. (13/03447-6, 13/11431-2, 11/08033-0, 14/01460-8, 13/20733-2)

MOTA, G. O.. THREE-COLOR BIPARTITE RAMSEY NUMBER FOR GRAPHS WITH SMALL BANDWIDTH.** SIAM JOURNAL ON DISCRETE MATHEMATICS**, v. 33, n. 1, p. 197-208, 2019. Web of Science Citations: 0. (18/04876-1)

(References retrieved automatically from State of São Paulo Research Institutions)

MOTA, Guilherme Oliveira. Dois resultados em combinatória contemporânea. Tese (Doutorado) - Instituto de Matemática e Estatística. Universidade de São Paulo (USP). São Paulo. (09/06294-0)

Please report errors in researcher information by writing to:
cdi@fapesp.br.