## Abstract A graph with __n__ vertices that contains no triangle and no 5‐cycle and minimum degree exceeding __n__/4 contains an independent set with at least (3__n__)/7 vertices. This is best possible. The proof proceeds by producing a homomorphism to the 7‐cycle and invoking the No Homomorphism
✦ LIBER ✦
Ideals of Graph Homomorphisms
✍ Scribed by Alexander Engström, Patrik Norén
- Book ID
- 120770380
- Publisher
- Springer
- Year
- 2012
- Tongue
- English
- Weight
- 784 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0218-0006
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Independence and graph homomorphisms gra
✍
Michael O. Albertson; Lily Chan; Ruth Haas
📂
Article
📅
1993
🏛
John Wiley and Sons
🌐
English
⚖ 305 KB
Geometric graph homomorphisms
✍
Debra L. Boutin; Sally Cockburn
📂
Article
📅
2011
🏛
John Wiley and Sons
🌐
English
⚖ 159 KB
## Abstract A __geometric graph__ is a simple graph drawn on points in the plane, in general position, with straightline edges. A __geometric__ __homomorphism__ from to is a vertex map that preserves adjacencies and crossings. This work proves some basic properties of geometric homomorphisms and
Characterization of additive *-homomorph
✍
L. Molnár
📂
Article
📅
1998
🏛
Springer
🌐
English
⚖ 318 KB
Derivations as Homomorphisms or Anti-hom
✍
Yu Wang; Hong You
📂
Article
📅
2006
🏛
Institute of Mathematics, Chinese Academy of Scien
🌐
English
⚖ 104 KB
On Lie ideals with derivations as homomo
✍
A. Asma; N. Rehman; A. Shakir
📂
Article
📅
2003
🏛
Akadmiai Kiad
🌐
English
⚖ 158 KB
Homomorphically full graphs
✍
Richard Brewster; Gary MacGillivray
📂
Article
📅
1996
🏛
Elsevier Science
🌐
English
⚖ 662 KB