It is shown that given a finite or infinite graph H and a subsemigroup B of its endomorphism semigroup End H, there exists a graph G such that (i) H is an induced subgraph of G, (ii) H is stable by every fe End 6. (iii) every f~ End G is uniquely determined by its restriction to H, (iv) the restric
✦ LIBER ✦
Semigroups of Strong Endomorphisms of Infinite Graphs and Hypergraphs
✍ Scribed by Bondar’, E. A.; Zhuchok, Yu. V.
- Book ID
- 121598325
- Publisher
- Springer
- Year
- 2013
- Tongue
- English
- Weight
- 278 KB
- Volume
- 65
- Category
- Article
- ISSN
- 0041-5995
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
On semigroups of graph endomorphisms
✍
S. Foldes; G. Sabidussi
📂
Article
📅
1980
🏛
Elsevier Science
🌐
English
⚖ 358 KB
Endomorphisms of graphs I. The monoid of
✍
Ulrich Knauer; Martin Nieporte
📂
Article
📅
1989
🏛
Springer
🌐
English
⚖ 405 KB
Semigroups of endomorphisms of some infi
✍
I. V. Pozdnyakova
📂
Article
📅
2013
🏛
Springer US
🌐
English
⚖ 112 KB
Chromatic number of finite and infinite
✍
Paul Erdös; Andras Hajnal
📂
Article
📅
1985
🏛
Elsevier Science
🌐
English
⚖ 349 KB
We wrote many papers on these subjects, some in collaboration with Galvin, Rado, Shelah and Szemer6di, and posed many problems some of which turned out to be undecidable. In this survey we state some old and new solved and unsolved problems. Nous avons 6crit beaucoup d'articles, certains en collabo
Injective endomorphisms of({cal G}_X - n
✍
Inessa Levi
📂
Article
📅
1992
🏛
Springer
🌐
English
⚖ 761 KB
The monoid of strong endomorphisms of a
✍
Weimin Li
📂
Article
📅
1994
🏛
Springer
🌐
English
⚖ 361 KB