scientific article; zbMATH DE number 15372

MaRDI QIDQ3972016zbMATH OpenFDO

Authors Zdzisław Skupień

Publication date 25 June 1992

zbMATH Keywords

acyclic graphbinomial inequalitydoubly exponential sequencespath-factors

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial inequalities (05A20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Review text

[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.

Recommendations

• scientific article; zbMATH DE number 3983182
• scientific article; zbMATH DE number 3893247
• scientific article; zbMATH DE number 3877220
• An extremal problem for paths in bipartite graphs
• scientific article; zbMATH DE number 3977047

Cited in

(2)

• scientific article; zbMATH DE number 3983182 (Why is no real title available?)
• Trees with maximum number of maximal matchings

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3972016)