Lower bounds for the average genus of a CF-graph (Q612933)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Lower bounds for the average genus of a CF-graph |
scientific article; zbMATH DE number 5827399
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounds for the average genus of a CF-graph |
scientific article; zbMATH DE number 5827399 |
Statements
Lower bounds for the average genus of a CF-graph (English)
0 references
16 December 2010
0 references
Summary: CF-graphs form a class of multigraphs that contains all simple graphs. We prove a lower bound for the average genus of a CF-graph which is a linear function of its Betti number. A lower bound for average genus in terms of the maximum genus and some structure theorems for graphs with a given average genus are also provided.
0 references
cactus free graph
0 references
CF-graph
0 references
average genus
0 references
Betti number
0 references
0 references
0.9080267
0 references
0.8926678
0 references
0 references
0.8891605
0 references
0.88840544
0 references
0.88153476
0 references
