Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-08-02
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Arc-disjoint, edge-disjoint and internally vertex-disjoint path families and their local separators

Definition

For the following definitions, a directed path occurrence in a finite labelled directed graph (V,A,tail⁡,head⁡), where V,A are finite and tail⁡,head⁡:A→V, is an alternating list v0,a1,v1,…,aℓ,vℓ with ai∈A, tail⁡(ai)=vi−1, and head⁡(ai)=vi for every i, whose displayed vertices are distinct. An undirected path occurrence in a finite undirected multigraph (Multigraphs, loops and directed graphs as variants distinct from the default finite simple graph) is an alternating list v0,e1,v1,…,eℓ,vℓ whose displayed vertices are distinct and whose displayed edge ei has endpoint set {vi−1,vi} for every i. Thus each path records its arc or edge labels, including when parallel labels have the same endpoints. An ordinary graph uses each edge e∈E as its own label with endpoint set e, while an ordinary digraph uses each ordered-pair arc (u,v) as its own label with tail⁡(u,v)=u and head⁡(u,v)=v.

For distinct s,t∈V, a family of directed s-t path occurrences is arc-disjoint if no arc label occurs in two paths; an arc separator is a set of arc labels whose deletion leaves no directed s-t path occurrence. For an undirected multigraph, replace arc labels by edge labels to obtain edge-disjoint paths and edge separators. Deleting labels means removing exactly those labels while retaining the other incidence data.

An s-t path family is internally vertex-disjoint if no vertex other than s,t occurs in two paths. A vertex separator is a set S⊆V∖{s,t} for which deleting S, together with every incident arc or edge label, leaves no s-t path occurrence. The local vertex comparison is used only when the terminals are nonadjacent (or, in the directed case, when no arc label has tail s and head t), so that such a separator can exist.

Depends on

Used by

Dependency tree · two levels

9 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources