On extremal graphs with no long paths (Q1379162)
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 1120234
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On extremal graphs with no long paths |
scientific article; zbMATH DE number 1120234 |
Statements
On extremal graphs with no long paths (English)
0 references
22 February 1998
0 references
Summary: Connected graphs with minimum degree \(\delta\) and at least \(2\delta+ 1\) vertices have paths with at least \(2\delta+ 1\) vertices. We provide a characterization of all such graphs which have no longer paths.
0 references
extremal graphs
0 references
paths
0 references
characterization
0 references
0.8052849769592285
0 references
0.8009619116783142
0 references
0.7990297079086304
0 references
