Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Treelike Snarks
View through CrossRef
We study snarks whose edges cannot be covered by fewer than five perfect matchings. Esperet and Mazzuoccolo found an infinite family of such snarks, generalising an example provided by Hägglund. We construct another infinite family, arising from a generalisation in a different direction. The proof that this family has the requested property is computer-assisted. In addition, we prove that the snarks from this family (we call them treelike snarks) have circular flow number $\phi_C (G)\ge5$ and admit a 5-cycle double cover.
The Electronic Journal of Combinatorics
Title: Treelike Snarks
Description:
We study snarks whose edges cannot be covered by fewer than five perfect matchings.
Esperet and Mazzuoccolo found an infinite family of such snarks, generalising an example provided by Hägglund.
We construct another infinite family, arising from a generalisation in a different direction.
The proof that this family has the requested property is computer-assisted.
In addition, we prove that the snarks from this family (we call them treelike snarks) have circular flow number $\phi_C (G)\ge5$ and admit a 5-cycle double cover.
Related Results
On the Limitations of Black-Box Constructions in Cryptography
On the Limitations of Black-Box Constructions in Cryptography
Cryptography is the science of secure communication. Originating as an esoteric discipline based on heuristics, it underwent a mayor paradigm shift in the past century. Modern cryp...
The Circular Chromatic Index of Flower Snarks
The Circular Chromatic Index of Flower Snarks
We determine the circular chromatic index of flower snarks, by showing that $\chi'_c(F_{3})=7/2$, $\chi'_c(F_{5})=17/5$ and $\chi'_c(F_{k})=10/3$ for every odd integer $k\ge 7$, wh...
Verifiable FHE via Lattice-based SNARKs
Verifiable FHE via Lattice-based SNARKs
Fully Homomorphic Encryption (FHE) is a prevalent cryptographic primitive that allows for computation on encrypted data. In various cryptographic protocols, this enables outsourcin...
Modeling Fluid’s Dynamics with Master Equations in Ultrametric Spaces Representing the Treelike Structure of Capillary Networks
Modeling Fluid’s Dynamics with Master Equations in Ultrametric Spaces Representing the Treelike Structure of Capillary Networks
We present a new conceptual approach for modeling of fluid flows in random porous media based on explicit exploration of the treelike geometry of complex capillary networks. Such p...
ZAPS: A Zero-Knowledge Proof Protocol for Secure UAV Authentication with Flight Path Privacy
ZAPS: A Zero-Knowledge Proof Protocol for Secure UAV Authentication with Flight Path Privacy
The increasing deployment of Unmanned Aerial Vehicles (UAVs) for military, commercial, and logistics applications has raised significant concerns regarding flight path privacy. Con...
The Petersen Graph
The Petersen Graph
The Petersen graph occupies an important position in the development of several areas of modern graph theory because it often appears as a counter-example to important conjectures....
Systematization of zero-knowledge proof methods
Systematization of zero-knowledge proof methods
The article systematizes modern methods of zero-knowledge proof (ZKP). Classification features are considered: protocol interactivity, algebraic or stochastic basis, need for trust...
Quantum Random Number Generation and ML-Based Authentication
Quantum Random Number Generation and ML-Based Authentication
The convergence of quantum physics and machine learning presents unprecedented opportunities for developing ultra-secure authentication systems. This comprehensive paper investigat...