A new lower bound for the number of roots of maps between graphs (Q1029917)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5578026
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new lower bound for the number of roots of maps between graphs |
scientific article; zbMATH DE number 5578026 |
Statements
A new lower bound for the number of roots of maps between graphs (English)
0 references
14 July 2009
0 references
A lower bound for the number of roots of maps between maps in any given homotopy class is presented and shown by example to be better than some previously obtained bounds.
0 references
root of map
0 references
graph
0 references
homotopy
0 references
0.7536200284957886
0 references
0.7488566040992737
0 references
0.745231568813324
0 references
0.7368221282958984
0 references
0.7286497354507446
0 references
