Cycle separating cuts in possible counterexamples to the cycle double cover and the Berge-Fulkerson conjectures

It is known that smallest counterexamples to Cycle Double Cover Conjecture and Berge-Fulkerson Conjecture (if they exist) are cyclically 4- and 5-edge-connected, respectively. We further analyse small cycle separating cuts in possible counterexamples. We prove that if a smallest counterexample G to CDC Conjecture contains a cycle separating 4-cut S, then the behaviour of the admissible CDC coverings along the dangling edges of the two 4-poles induced by S is uniquely determined among more than 219 a priori possibilities. Similarly, for the Berge-Fulkerson Conjecture, we prove that among more than 2111 a priori possibilities, there are only 13 pairs of admissible sets that could occur along the dangling edges of a 5-cut in a smallest counterexample.

Authors

Institutions

Publication Details

Journal
Ars Mathematica Contemporanea
Published
2025-03-11
DOI
https://doi.org/10.26493/1855-3974.3409.c13
Primary Topic
Limits and Structures in Graph Theory
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Cycle separating cuts in possible counterexamples to the cycle double cover and the Berge-Fulkerson conjectures

Edita Máčajová, Gloria Tabarelli, Giuseppe Mazzuoccolo
Ars Mathematica Contemporanea
Limits and Structures in Graph Theory
article

Cycle separating cuts in possible counterexamples to the cycle double cover and the Berge-Fulkerson conjectures

Edita Máčajová, Gloria Tabarelli, Giuseppe Mazzuoccolo
article en

Abstract

It is known that smallest counterexamples to Cycle Double Cover Conjecture and Berge-Fulkerson Conjecture (if they exist) are cyclically 4- and 5-edge-connected, respectively. We further analyse small cycle separating cuts in possible counterexamples. We prove that if a smallest counterexample G to CDC Conjecture contains a cycle separating 4-cut S, then the behaviour of the admissible CDC coverings along the dangling edges of the two 4-poles induced by S is uniquely determined among more than 219 a priori possibilities. Similarly, for the Berge-Fulkerson Conjecture, we prove that among more than 2111 a priori possibilities, there are only 13 pairs of admissible sets that could occur along the dangling edges of a 5-cut in a smallest counterexample.

Ars Mathematica ContemporaneaVol. 26(2)
University of Verona (IT), University of Modena and Reggio Emilia (IT), Comenius University Bratislava (SK)
Climate action
Openalex Percentile: Top 93%
Limits and Structures in Graph Theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Cycle separating cuts in possible counterexamples to the cycle double cover and the Berge-Fulkerson conjectures — Edita Máčajová, Gloria Tabarelli, et al. · Ars Mathematica Contemporanea (2025) | TGRS Research Map | TGRS