Embedding, randomised and structural problems in extremal graph theory

Problems in discrete probability, extremal set theory and extremal graph theory

Quasi-random hypergraphs and spanning subhypergraph containment

Send your message by email

Advanced search

Grant number: | 13/20733-2 |

Support type: | Scholarships abroad - Research Internship - Post-doctor |

Effective date (Start): | January 02, 2015 |

Effective date (End): | January 01, 2016 |

Field of knowledge: | Physical Sciences and Mathematics - Computer Science - Computational Mathematics |

Principal Investigator: | Yoshiharu Kohayakawa |

Grantee: | Guilherme Oliveira Mota |

Supervisor abroad:
| Mathias Schacht |

Home Institution: | Instituto de Matemática e Estatística (IME). Universidade de São Paulo (USP). São Paulo , SP, Brazil |

Local de pesquisa : | Universität Hamburg (UHH), Germany |

Associated to the scholarship: | 13/11431-2 - Extremal and probabilistic combinatorics, BP.PD |

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 researcher who will supervise this student is Mathias Schacht. The postdoctoral project of this student aims to contribute to the development of the extremal and probabilistic combinatorics. The candidate will study problems related to the embedding of spanning trees in random graphs, hypergraph regularity and the structure of dense graphs with large girth. (AU) | |

Scientific publications
(12)

(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)

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.

KOHAYAKAWA, YOSHIHARU;
MOTA, GUILHERME OLIVEIRA;
SCHACHT, MATHIAS.
Monochromatic trees in random graphs.
** MATHEMATICAL PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY**,
v. 166,
n. 1,
p. 191-208,
JAN 2019.
Web of Science Citations: 2.

BOTLER, F.;
MOTA, G. O.;
OSHIRO, M. T. I.;
WAKABAYASHI, Y.
Decomposing highly connected graphs into paths of length five.
** DISCRETE APPLIED MATHEMATICS**,
v. 245,
n. SI,
p. 128-138,
AUG 20 2018.
Web of Science Citations: 1.

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.

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.

BOTLER, F.;
MOTA, G. O.;
OSHIRO, M. T. I.;
WAKABAYASHI, Y.
Decomposing regular graphs with prescribed girth into paths of given length.
** EUROPEAN JOURNAL OF COMBINATORICS**,
v. 66,
p. 28-36,
DEC 2017.
Web of Science Citations: 0.

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.

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.

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.

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.

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.

ALLEN, P.;
KOHAYAKAWA, Y.;
MOTA, G. O.;
PARENTE, R. F.
On the number of orientations of random graphs with no directed cycles of a given length.
** ELECTRONIC JOURNAL OF COMBINATORICS**,
v. 21,
n. 1
MAR 10 2014.
Web of Science Citations: 0.

Please report errors in scientific publications list by writing to:
cdi@fapesp.br.