{"paper":{"title":"Interlacement in 4-regular graphs: a new approach using nonsymmetric matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lorenzo Traldi","submitted_at":"2012-04-02T18:11:43Z","abstract_excerpt":"Let F be a 4-regular graph with an Euler system C. We introduce a simple way to modify the interlacement matrix of C so that every circuit partition P of F has an associated modified interlacement matrix M(C,P). If C and C' are Euler systems of F then M(C,C') and M(C',C) are inverses, and for any circuit partition P, M(C',P)=M(C',C)M(C,P). This machinery allows for short proofs of several results regarding the linear algebra of interlacement."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.0482","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}