✦ LIBER ✦

A sharp bound for the degree of proper monomial mappings between balls

✍ Scribed by John P. D’Angelo; Šimon Kos; Emily Riehl

Publisher: Springer-Verlag
Year: 2003
Tongue: English
Weight: 669 KB
Volume: 13
Category: Article
ISSN: 1050-6926
DOI: 10.1007/bf02921879

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Upper bound for the degree of an approxi

Upper bound for the degree of an approximating monomial

✍ Sayel A Ali 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 929 KB

A sharp lower bound for the circumferenc

A sharp lower bound for the circumference of 1-tough graphs with large degree sums

✍ Vu Dinh Hoa 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 207 KB 👁 1 views

## Abstract We show that every 1‐tough graph __G__ on __n__ ≥ 3 vertices with σ~3~≧ __n__ has a cycle of length at least min{__n, n__ + (σ~3~/3 ) − α + 1}, where σ~3~ denotes the minimum value of the degree sum of any 3 pairwise nonadjacent vertices and α the cardinality of a miximum independent se