Exponential Lower Bound on the Number of Circuit Double Covers in Planar Cubic Graphs

Основні поняття

Every bridgeless cubic planar (multi)graph has at least (5/2)^(n/4-1/2) circuit double covers, where n is the number of vertices.

Анотація

The paper studies a counting version of the Cycle Double Cover Conjecture, which asks for the existence of exponentially many circuit double covers in bridgeless graphs.

The key insights are:

1. Counting circuit double covers (CiDCs) is more interesting than counting cycle double covers (CyDCs), as a single CiDC can correspond to multiple CyDCs.

2. An almost-exponential lower bound for graphs with surface embeddings of representativity at least 4 is given using a "flower construction" that locally modifies the CiDC.

3. An exponential lower bound for planar graphs is proved using a linear representation of CiDCs, which allows reducing the problem to solving linear programs.

4. A conjecture is made that every bridgeless cubic graph has at least 2^(n/2-1) circuit double covers, and an infinite class of graphs is shown where this bound is tight.

5. Experiments on small graphs suggest that the conjecture may hold for triangle-free or more cyclically connected graphs, but not for general planar graphs. An improved exponential bound of (5/2)^(n/4-1/2) is proved for planar cubic graphs.

Статистика

None.

Цитати

None.

Ключові висновки, отримані з

Counting Circuit Double Covers

by Rade... о arxiv.org 09-12-2024

https://arxiv.org/pdf/2303.10615.pdf

Глибші Запити

Can the exponential lower bound for planar graphs be further improved, or is the (5/2)^(n/4-1/2) bound tight?

The exponential lower bound of the form (5/2)^(n/4-1/2) for the number of circuit double covers (CiDCs) in bridgeless cubic planar graphs is a significant result, but whether it is tight remains an open question. The current bound is derived from a combination of techniques, including the use of linear programming and the analysis of specific graph structures, such as 4-cycles and 5-cycles. While the bound is robust, there is potential for improvement, particularly through the exploration of additional graph properties or more refined combinatorial techniques. Future research could focus on identifying specific families of planar graphs that might yield higher counts of CiDCs or leveraging advanced counting methods to refine the existing bounds. Thus, while the (5/2)^(n/4-1/2) bound is a strong starting point, it is not definitively tight, and further exploration could yield better results.

Are there other classes of graphs, beyond planar and cyclically 4-edge-connected graphs, for which exponential lower bounds on the number of circuit double covers can be proved?

Yes, there are other classes of graphs beyond planar and cyclically 4-edge-connected graphs for which exponential lower bounds on the number of circuit double covers can be established. For instance, certain classes of graphs with specific structural properties, such as high edge-connectivity or specific embeddings in surfaces with non-trivial topology, may also exhibit exponentially many CiDCs. Additionally, research into classes like snarks, which are non-planar cubic graphs with specific properties, has shown promise in establishing lower bounds. The techniques used in planar graphs, such as the flower construction and linear representations, can often be adapted to these other classes, suggesting that a broader range of graphs may possess similar exponential growth in the number of circuit double covers.

What are the implications of having exponentially many circuit double covers for practical applications, such as in network design or graph theory problems?

The existence of exponentially many circuit double covers has significant implications for various practical applications, particularly in network design and graph theory problems. In network design, circuit double covers can be utilized to ensure redundancy and reliability in communication networks. By ensuring that every edge is covered by multiple circuits, networks can maintain connectivity even in the presence of failures or disruptions. This redundancy is crucial for designing robust networks that can withstand node or edge failures.
In graph theory, the study of circuit double covers contributes to understanding the structure and properties of graphs, particularly in relation to flow theory and matching problems. The ability to count and construct multiple circuit double covers can lead to insights into the graph's connectivity and flow properties, which are essential in optimization problems. Furthermore, the techniques developed for counting CiDCs can be applied to other combinatorial problems, enhancing the toolkit available for researchers and practitioners in discrete mathematics and theoretical computer science. Overall, the implications of having exponentially many circuit double covers extend beyond theoretical interest, influencing practical applications in technology and optimization.