𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A tight lower bound on the maximum genus of a simplicial graph

✍ Scribed by Jianer Chen; Saroja P. Kanchi; Jonathan L. Gross


Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
856 KB
Volume
156
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis


It is proved that every connected simplicial graph with minimum valence at least three has maximum genus at least one-quarter of its cycle rank. This follows from the technical result that every 3-regular simplicial graph except K4 has a Xuong co-tree whose odd components have only one edge each. It is proved, furthermore, that this lower bound is tight. However, examples are used to illustrate that it does not apply to non-simplicial graphs. This result on maximum genus leads to several immediate consequences for average genus.


πŸ“œ SIMILAR VOLUMES


Survey of results on the maximum genus o
✍ Richard D. Ringeisen πŸ“‚ Article πŸ“… 1979 πŸ› John Wiley and Sons 🌐 English βš– 619 KB

## Abstract Some of the early questions concerning the maximum genus of a graph have now been answered. In this paper we survey the progress made on such problems and present some recent results, outlining proofs for some of the major theorems.

Tight bounds on the chromatic sum of a c
✍ Carsten Thomassen; Paul ErdΓΆs; Yousef Alavi; Paresh J. Malde; Allen J. Schwenk πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 236 KB πŸ‘ 1 views