Extremal and probabilistic problems in graph colorings

• Grant number: 20/08252-2
• Support Opportunities: Scholarships in Brazil - Post-Doctoral
• Start date: November 01, 2020
• End date: July 31, 2022
• Field of knowledge: Physical Sciences and Mathematics - Computer Science - Computational Mathematics
• Principal Investigator: Yoshiharu Kohayakawa
• Grantee: Lucas Colucci Cavalcante de Souza
• Host Institution: Instituto de Matemática e Estatística (IME). Universidade de São Paulo (USP). São Paulo , SP, Brazil
• Associated research grant: 18/04876-1 - Ramsey theory, structural graph theory and applications in Bioinformatics, AP.JP

Abstract

This is the research project for the postdoctoral fellowship of Lucas Colucci Cavalcante de Souza, to be undertaken under the supervision ofY.Kohayakawa, at the Instituto de Matemática e Estatística,USP, from 14/09/2020 to 13/09/2022. In this project, the following topics on edge-colorings of graphs will be addressed: (1) coloring modulo~$k$; (2) coloring without monochromatic subgraphs;(3) $P_4$-chromatic index;(4) locally irregular coloring.

Scientific publications

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

BOTLER, FABIO; COLUCCI, LUCAS; KOHAYAKAWA, YOSHIHARU. The mod k chromatic index of random graphs. JOURNAL OF GRAPH THEORY, v. 103, n. 4, p. 13-pg., 2023-03-08. (18/04876-1, 20/08252-2, 15/11937-9, 19/13364-7)

BOTLER, FABIO; COLUCCI, LUCAS; KOHAYAKAWA, YOSHIHARU. The mod k chromatic index of graphs is O(k). JOURNAL OF GRAPH THEORY, v. 102, n. 1, p. 4-pg., 2022-07-30. (18/04876-1, 19/13364-7, 15/11937-9, 20/08252-2)