REVIEW 1 cited by
Matching number, Hamiltonian graphs and discrete magnetic Laplacians
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
In this article, we relate the spectrum of the discrete magnetic Laplacian (DML) on a finite simple graph with two structural properties of the graph: the existence of a perfect matching and the existence of a Hamiltonian cycle of the underlying graph. In particular, we give a family of spectral obstructions parametrised by the magnetic potential for the graph to be matchable (i.e., having a perfect matching) or for the existence of a Hamiltonian cycle. We base our analysis on a special case of the spectral preorder introduced in [FCLP20a] and we use the magnetic potential as a spectral control parameter.
Forward citations
Cited by 1 Pith paper
-
Finite Quantum Histories: Holonomy Spectra, Minimal Clocks, and Exact Clock-Change Covariance
Every finite cyclic quantum history is classified by the monodromy of its unitary steps, and the exact spectrum, zero-energy sector, and minimal clock rules follow from that one operator.
Discussion (0). Continue with ORCID to comment.