Partitioning and Covering of Graphs

• Grant number: 24/14906-6
• Support Opportunities: Regular Research Grants
• Start date: June 01, 2025
• End date: May 31, 2028
• Field of knowledge: Physical Sciences and Mathematics - Computer Science - Theory of Computation
• Principal Investigator: Fábio Happ Botler
• Grantee: Fábio Happ Botler
• Host Institution: Instituto de Matemática e Estatística (IME). Universidade de São Paulo (USP). São Paulo , SP, Brazil
• Associated researchers: Andrea Patricia Jiménez Ramírez ; Luiz Paulo Freire Moreira ; Marthe Armande Adèle Bonamy ; Natasha Naina Morrison ; Tássio Naia dos Santos

Abstract

Graphs and other combinatorial structures are fundamental components of the foundation of Computer Science, specially for being the ideal mathematical structures for the representation of networks. Therefore, it is interesting to master their properties in order to manipulate them efficiently. This project proposes the investigation of partition problems and covering problems in graphs. These are fundamental and classic subjects in Graph Theory, on which there is a broad literature, rich in results, but also in challenging open problems.The objective of this project is to contribute to the state of the art of Graph Theory, answering partially or entirely theoretical problems that are of interest to the academic community, and in which the proponent has obtained recent advances.In this way, we aim to contribute to basic and fundamental science. (AU)