𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An improved upper bound in the maximum dispersal problem

✍ Scribed by Michael H. Moore

Publisher
Elsevier Science
Year
1974
Tongue
English
Weight
220 KB
Volume
8
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An improved bound on the maximum agreeme
An improved bound on the maximum agreement subtree problem
✍ Mike Steel; LΓ‘szlΓ³ A. SzΓ©kely πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 299 KB

We improve the lower bound on the extremal version of the Maximum Agreement Subtree problem. Namely we prove that two binary trees on the same n leaves have subtrees with the same β‰₯ c log log n leaves which are homeomorphic, such that homeomorphism is identity on the leaves.

An improved upper bound on the non-3-col
An improved upper bound on the non-3-colourability threshold
✍ Paul E. Dunne; Michele Zito πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 470 KB

In this paper we derive an improved upper bound on the average vertex degree, 6. needed to ensure that: Vc > 0 and n sufficiently large, a random n-vertex graph with at least (6 + E)&! edges is almost certainly not 3-colourable. @

An improved upper bound on the crossing
An improved upper bound on the crossing number of the hypercube
✍ Luerbio Faria; Celina Miraglia Herrera de Figueiredo; Ondrej SΓ½kora; Imrich Vrt' πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 288 KB

## Abstract We draw the __n__‐dimensional hypercube in the plane with ${5\over 32}4^{n}-\lfloor{{{{n}^{2}+1}\over 2}}\rfloor {2}^{n-2}$ crossings, which improves the previous best estimation and coincides with the long conjectured upper bound of ErdΓΆs and Guy. Β© 2008 Wiley Periodicals, Inc. J Graph