Directions in Infinite Graphs: topological, combinatorial and set-theoretical appr...
A theoretical and computational approach for the community detection problem in ne...
A theoretical and computational approach for the community detection problem
Grant number: | 21/13373-6 |
Support Opportunities: | Scholarships in Brazil - Master |
Start date: | May 01, 2022 |
End date: | February 29, 2024 |
Field of knowledge: | Physical Sciences and Mathematics - Mathematics |
Principal Investigator: | Leandro Fiorini Aurichi |
Grantee: | Lucas Silva Sinzato Real |
Host Institution: | Instituto de Ciências Matemáticas e de Computação (ICMC). Universidade de São Paulo (USP). São Carlos , SP, Brazil |
Abstract This research project aims to study properties of infinite graphs via tools developed by Graph and Set Theories to deal with the Unfriendly Partition Conjecture, trivial in the context of graphs with finite set of vertices but rich when formulated in a general scenario.Although presented as a simple question related to graph colouring, the comprehension of the results developed so far about that conjecture lights also other structural properties of infinite graphs. For example, the existence of unfriendly partitions in rayless graphs can be confirmed once established that this graph family is built by a specific hierarchical procedure.About the Unfriendly Partition Conjecture formulated in a general way, on the other hand, many questions can be asked regarding the only counterexamples published so far, presented by the mathematicians Milner and Shelah. These graphs have all its vertices with infinite degree and cardinality greater than or equal to the first limit cardinal greater than the continuum. Consistently, however, it is possible to conclude that there are necessary at least continuum vertices to construct a graph with the properties described by these authors. To study the existence of unfriendly partitions between these two limit scenarios, therefore, the comprehension of tools from fundamentals of mathematics is needed. | |
News published in Agência FAPESP Newsletter about the scholarship: | |
More itemsLess items | |
TITULO | |
Articles published in other media outlets ( ): | |
More itemsLess items | |
VEICULO: TITULO (DATA) | |
VEICULO: TITULO (DATA) | |