Busca avançada
Ano de início
Entree


Limits of cycles and cover conjectures

Texto completo
Autor(es):
Aurichi, Leandro ; Magalhaes Jr, Paulo ; Seixas, Luisa
Número total de Autores: 3
Tipo de documento: Artigo Científico
Fonte: DISCRETE MATHEMATICS; v. 349, n. 2, p. 16-pg., 2026-08-07.
Resumo

The Cycle Double Cover Conjecture was posed independently in 1973 by Szekeres and in 1979 by Seymour, who also posed its generalization, the Faithful Cycle Cover Conjecture. When discussing cycle cover conjectures for infinite graphs, we can consider covers by finite cycles-as in Laviolette [7]- or by infinite cycles-as in Bruhn, Diestel and Stein [1]. Here, we present an alternative notion, through which we may generalize what was presented by Bruhn et al. We aim to restate those conjectures, using F-limits-a structure that can be approximated by finite cycles-instead of cycles, and prove that, if the conjectures hold for finite graphs, then they hold for all graphs. (c) 2025 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies. (AU)

Processo FAPESP: 23/15912-7 - Combinatória infinita em grafos
Beneficiário:Luisa Gomes Seixas
Modalidade de apoio: Bolsas no Brasil - Mestrado
Processo FAPESP: 21/02803-0 - Teoria dos conjuntos e combinatória infinita
Beneficiário:Luisa Gomes Seixas
Modalidade de apoio: Bolsas no Brasil - Iniciação Científica
Processo FAPESP: 23/00595-6 - Grafos infinitos e aplicações de teoria dos conjuntos
Beneficiário:Leandro Fiorini Aurichi
Modalidade de apoio: Auxílio à Pesquisa - Regular