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
Ban‐Linial's Conjecture and Halin Snarks
Ban‐Linial's Conjecture and Halin Snarks
ABSTRACT
A 2‐bisection is a 2‐coloring of (not necessarily proper) such that each color class has the same cardinality, and each monochromatic component has at m...
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...
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...
Performance Evaluation of zk-SNARK Protocols for Privacy-Preserving Sensor Data Verification: A Systematic Benchmarking Study
Performance Evaluation of zk-SNARK Protocols for Privacy-Preserving Sensor Data Verification: A Systematic Benchmarking Study
The proliferation of sensor networks in critical infrastructure, healthcare monitoring, and smart city applications demands robust privacy-preserving mechanisms for data verificati...
Circular Chromatic Index of Generalized Blanuša Snarks
Circular Chromatic Index of Generalized Blanuša Snarks
In his Master's thesis, Ján Mazák proved that the circular chromatic index of the type 1 generalized Blanuša snark $B^1_n$ equals $3+{2\over n}$. This result provided the first in...
Dynamics of Dual Scale-Free Polymer Networks
Dynamics of Dual Scale-Free Polymer Networks
We focus on macromolecules which are modeled as sequentially growing dual scale-free networks. The dual networks are built by replacing star-like units of the primal treelike scale...