On the cancellation law among finite relational structures
✍ Scribed by L. Lovász
- Publisher
- Springer Netherlands
- Year
- 1971
- Tongue
- English
- Weight
- 532 KB
- Volume
- 1
- Category
- Article
- ISSN
- 0031-5303
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In this paper, we introduce a measure of the extent to which a finite combinatorial structure is a Ramsey object in the class of objects with a similar structure. We show for classes of finite relational structures, including graphs, binary posets, and bipartite graphs, how this measure depends on t
We show that for every computably enumerable (c.e.) degree a¿0 there is an intrinsically c.e. relation on the domain of a computable structure of computable dimension 2 whose degree spectrum is {0; a}, thus answering a question of Goncharov and Khoussainov (Dokl. Math. 55 (1997) 55-57). We also show