On the Space of 2-Linkages
Abstract
Let G=(V,E) be a finite undirected graph. If P is an oriented path from r1∈ V to r2∈ V, we define ∂(P) = r2-r1. If R, S⊂eq V, we denote by P(G; R, S) the span of the set of all ∂ P ∂ Q with P and Q disjoint oriented paths of G connecting vertices in R and S, respectively. By L(R, S), we denote the submodule of Z R S consisting all Σr∈ R, s∈ S c(r,s)r s such that c(r,r) = 0 for all r∈ R S, Σr∈ R c(r, s) = 0 for all s∈ S, and Σs∈ S c(r, s) = 0 for all r∈ R. In this paper, we provide, when G is sufficiently connected, characterizations when P(G; R, S) is a proper subset of L(R, S).
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.