Is Ramsey's theorem omega-automatic - Computer Science > Logic in Computer ScienceReportar como inadecuado




Is Ramsey's theorem omega-automatic - Computer Science > Logic in Computer Science - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: We study the existence of infinite cliques in omega-automatic hyper-graphs.It turns out that the situation is much nicer than in general uncountablegraphs, but not as nice as for automatic graphs.More specifically, we show that every uncountable omega-automatic graphcontains an uncountable co-context-free clique or anticlique, but notnecessarily a context-free let alone regular clique or anticlique. We alsoshow that uncountable omega-automatic ternary hypergraphs need not haveuncountable cliques or anticliques at all.



Autor: Dietrich Kuske

Fuente: https://arxiv.org/







Documentos relacionados