{"paper":{"title":"Free multiflows in bidirected and skew-symmetric graphs","license":"","headline":"","cross_cats":[],"primary_cat":"math.DG","authors_text":"A.V. Karzanov, M.A. Babenko","submitted_at":"2005-10-21T13:46:39Z","abstract_excerpt":"A graph (digraph) $G=(V,E)$ with a set $T\\subseteq V$ of terminals is called inner Eulerian if each nonterminal node $v$ has even degree (resp. the numbers of edges entering and leaving $v$ are equal). Cherkassky and Lov\\'asz showed that the maximum number of pairwise edge-disjoint $T$-paths in an inner Eulerian graph $G$ is equal to $\\frac12\\sum_{s\\in T} \\lambda(s)$, where $\\lambda(s)$ is the minimum number of edges whose removal disconnects $s$ and $T-\\{s\\}$. A similar relation for inner Eulerian digraphs was established by Lomonosov. Considering undirected and directed networks with ``inner"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0510463","kind":"arxiv","version":1},"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"}