๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On computing the number of linear extensions of a tree

โœ Scribed by M. D. Atkinson

Publisher
Springer Netherlands
Year
1990
Tongue
English
Weight
147 KB
Volume
7
Category
Article
ISSN
0167-8094

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Approximating the number of linear exten
Approximating the number of linear extensions
โœ Kevin Ewacha; Ivan Rival; Nejib Zaguia ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 737 KB

We approximate the number of linear extensions of an ordered set by counting "critical" suborders.

The number of linear extensions of subse
The number of linear extensions of subset ordering
โœ Jichang Sha; D.J. Kleitman ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 520 KB

We find asymptotic upper and lower bounds on the number of linear extensions of the containment ordering of subsets of a finite set. These agree in their most significant non-trivial terms. A related open question is described. L > 2"((n + 1)log 2 -4 log 2m -5 + o(1 ln)).

The number of linear extensions of bipar
The number of linear extensions of bipartite graphs
โœ Grzegorz Stachowiak ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Springer Netherlands ๐ŸŒ English โš– 124 KB

The number of linear extensions among the orientations of a bipartite graph is maximum just if the orientation itself is bipartite, the natural one.

On the Number of Precolouring Extensions
On the Number of Precolouring Extensions
โœ Klaus Dohmen ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 82 KB

We investigate the number of proper ฮป-colourings of a hypergraph extending a given proper precolouring. We prove that this number agrees with a polynomial in ฮป for any sufficiently large ฮป, and we establish a generalization of Whitney's broken circuit theorem by applying a recent improvement of the