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

On the Ferrers dimension of a digraph

โœ Scribed by Olivier Cogis

Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
714 KB
Volume
38
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis

The Ferrer-s dimension of a digraph has been shown to be an extension of the order dimension. By proving a property of (finite) transitive Ferrers digraphs, we give an original proof of this above result and derive Ore's alternative definition of the order dimension. Still, the order dimension is proved to be 'polynomially equivalent' to the Ferrers dirneirsion.

๐Ÿ“œ SIMILAR VOLUMES

On a Likely Shape of the Random Ferrers
On a Likely Shape of the Random Ferrers Diagram
โœ Boris Pittel ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 513 KB

We study the random partitions of a large integer n, under the assumption that all such partitions are equally likely. We use Fristedt's conditioning device which ลฝ . connects the parts summands distribution to the one of a g-sequence, that is, a sequence of independent random variables, each distri

On the Cover Polynomial of a Digraph
On the Cover Polynomial of a Digraph
โœ F.R.K. Chung; R.L. Graham ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 511 KB
On independent circuits of a digraph
On independent circuits of a digraph
โœ S. Rao Kosaraju ๐Ÿ“‚ Article ๐Ÿ“… 1977 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 156 KB

## Abstract If every three circuits of a digraph have a common vertex, then all the circuits have one.

On the Capacity of Digraphs
On the Capacity of Digraphs
โœ Noga Alon ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 76 KB

For a digraph G = (V, E) let w(G n ) denote the maximum possible cardinality of a subset S of V n in which for every ordered pair It is also shown that for every n there is a tournament T on 2n vertices whose capacity is at least โˆš n, whereas the maximum number of vertices in a transitive subtourna