A proof of the two-path conjecture (Q5960794)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1730014
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A proof of the two-path conjecture |
scientific article; zbMATH DE number 1730014 |
Statements
A proof of the two-path conjecture (English)
0 references
25 April 2002
0 references
The authors prove the following result: If a graph \(G\) decomposes into two paths \(X\) and \(Y\), each of length \(n\) with \(n\geq 2\), and \(X\) and \(Y\) have at least one common vertex, then \(G\) has a path of length \(n\) distinct from \(X\) and \(Y\).
0 references
connected graph
0 references
path
0 references
0.90586686
0 references
0.90082437
0 references
0 references
0.8761684
0 references
0.86969924
0 references
0.86901814
0 references
0.8684664
0 references
0 references
0.8622041
0 references
0.8597163
0 references
