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 , where are finite and , is an alternating list with , , and for every , 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 whose displayed vertices are distinct and whose displayed edge has endpoint set for every . Thus each path records its arc or edge labels, including when parallel labels have the same endpoints. An ordinary graph uses each edge as its own label with endpoint set , while an ordinary digraph uses each ordered-pair arc as its own label with and .
For distinct , a family of directed - 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 - 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 - path family is internally vertex-disjoint if no vertex other than occurs in two paths. A vertex separator is a set for which deleting , together with every incident arc or edge label, leaves no - 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 and head ), so that such a separator can exist.
Depends on
- Walks, closed walks, trails, paths and cycles, with length equal to the number of traversed edges
- Directed walks, trails, paths and cycles, and strong connectivity
- Vertex and edge deletion, edge contraction, graph minors, subdivisions and topological minors
- Multigraphs, loops and directed graphs as variants distinct from the default finite simple graph
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 11 results over 7 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- D. Hulpke, Graph Theory notes (standard reference, not scraped)