𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Semi-groups and graphs for sofic systems

✍ Scribed by Bruce Kitchens; Selim Tuncel

Book ID
112889218
Publisher
The Hebrew University Magnes Press
Year
1986
Tongue
English
Weight
951 KB
Volume
53
Category
Article
ISSN
0021-2172

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Sofic systems and graphs
Sofic systems and graphs
✍ Roland Fischer πŸ“‚ Article πŸ“… 1975 πŸ› Springer Vienna 🌐 English βš– 457 KB
Algorithms for coloring semi-random grap
Algorithms for coloring semi-random graphs
✍ C. R. Subramanian; Martin FΓΌrer; C. E. Veni Madhavan πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 373 KB πŸ‘ 3 views

The graph coloring problem is to color a given graph with the minimum number of colors. This problem is known to be NP-hard even if we are only aiming at approximate solutions. On the other hand, the best known approximation algorithms require ␦ Ž . Ž . n ␦ ) 0 colors even for bounded chromatic k-co

Partition graphs for finite symmetric gr
Partition graphs for finite symmetric groups
✍ Conder, Marston; Morton, Margaret; Praeger, Cheryl E. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 130 KB πŸ‘ 2 views

This paper outlines an investigation of a class of arc-transitive graphs admitting a f inite symmetric group S n acting primitively on vertices, with vertex-stabilizer isomorphic to the wreath product S m wr S r (preserving a partition of {1, 2, . . . , n} into r parts of equal size m). Several prop