No label defined (Q3972016)
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 15372
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 15372 |
Statements
25 June 1992
0 references
path-factors
0 references
doubly exponential sequences
0 references
binomial inequality
0 references
acyclic graph
0 references
0.7242103219032288
0 references
[For the entire collection see Zbl 0698.00017.] A path-factor of a graph \(G\) is defined as a spanning subgraph with each component of connectivity being a path. As the problem of determining the maximal number of edges in a path-factor of an arbitrary graph \(G\) seems to be hard, in the paper is considered the case of acyclic graphs. Using binomial inequalities it is given an estimation of the maximal number of edges in a path-factor of an acyclic graph.
0 references
