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

Plane partitions V: The TSSCPP conjecture

โœ Scribed by George E Andrews

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
338 KB
Volume
66
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Notes on plane partitions, V
Notes on plane partitions, V
โœ Basil Gordon ๐Ÿ“‚ Article ๐Ÿ“… 1971 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 403 KB
Confirming Two Conjectures About the Int
Confirming Two Conjectures About the Integer Partitions
โœ Boris Pittel ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 127 KB

For a given integer n, let 4 n denote the set of all integer partitions \* 1 \* 2 } } } \* m >0 (m 1), of n. For the dominance order ``P'' on 4 n , we show that if two partitions \*, + are both chosen from 4 n uniformly at random, and independent of each other, then Pr(\*P +) ร„ 0 as n ร„ . This state

On the Berge's strong path partition con
On the Berge's strong path partition conjecture
โœ S. Sridharan ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 312 KB

Sridharan, S., On the Berge's strong path partition conjecture, Discrete Mathematics 112 (1993) 289-293. It is proved that for every k-optimal path partition of a digraph in which each component contains at most one cycle, there exists a partial k-coloring which colors strongly every path of the pa

Tutte's 5-flow conjecture for the projec
Tutte's 5-flow conjecture for the projective plane
โœ Richard Steinberg ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 300 KB

Heawood proved that every planar graph with no 1-cycles is vertex 5colorable, which is equivalent to the statement that every planar graph with no 1-bonds has a nowhere-zero 5-flow. Tutte has conjectured that every graph with no 1-bonds has a nowhere-zero 5-flow. We show that Tutte's 5-Flow Conjectu