Packing paths in a (λ+μ)Kv+u-λ Kv

Abstract

Following standard terminology, λ Kv is a multigraph on v vertices such that λ edges join each pair of vertices. Let (λ+μ)Kv+u-λ Kv be the graph (V U,E) with |V|=v, |U|=u, and (λ+μ)-λ=μ edges between the vertices x and y if x and y both lie in V and λ+μ edges between x and y otherwise. The main result of this paper establishes necessary and sufficient conditions for an m-path decomposition of (λ+μ)Kv+u-λ Kv.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…