| Texto completo | |
| Autor(es): |
Fernandes, Cristina G.
;
Mota, Guilherme Oliveira
;
Sanhueza-Matamala, Nicolas
Número total de Autores: 3
|
| Tipo de documento: | Artigo Científico |
| Fonte: | LATIN 2024: THEORETICAL INFORMATICS, PT II; v. 14579, p. 16-pg., 2024-01-01. |
| Resumo | |
We prove that in any n-vertex complete graph there is a collection P of (1 + o(1))n paths that strongly separates any pair of distinct edges e, f, meaning that there is a path in P which contains e but not f. Furthermore, for certain classes of n-vertex an-regular graphs we find a collection of (root 3 alpha + 1 - 1+ o(1))n paths that strongly separates any pair of edges. Both results are best-possible up to the o(1) term. (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 |