| Texto completo | |
| Autor(es): |
Botler, F.
;
Jimenez, A.
;
Lintzmayer, C. N.
;
Pastine, A.
;
Quiroz, D. A.
;
Sambinelli, M.
Número total de Autores: 6
|
| Tipo de documento: | Artigo Científico |
| Fonte: | EUROPEAN JOURNAL OF COMBINATORICS; v. 122, p. 16-pg., 2024-08-12. |
| Resumo | |
The analogue of Hadwiger's conjecture for the immersion relation states that every graph G contains an immersion of K-chi(G). For graphs with independence number 2, this is equivalent to stating that every such n-vertex graph contains an immersion of K-(sic)n/2(sic). We show that every n-vertex graph with independence number 2 contains every complete bipartite graph on (sic)n/2(sic) vertices as an immersion. (c) 2024 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies. (AU) | |
| Processo FAPESP: | 19/13364-7 - Problemas extremais e estruturais em teoria dos grafos |
| Beneficiário: | Cristina Gomes Fernandes |
| Modalidade de apoio: | Auxílio à Pesquisa - Regular |