Is Ramsey's theorem omega-automatic?

Details Is Ramsey's theorem omega-automatic? Is Ramsey's theorem omega-automatic?

2009-12-14

arxiv.org/abs/0912.2625v2

Computer Science

Logic in Computer Science

Scientific paper

We study the existence of infinite cliques in omega-automatic (hyper-)graphs. It turns out that the situation is much nicer than in general uncountable graphs, but not as nice as for automatic graphs. More specifically, we show that every uncountable omega-automatic graph contains an uncountable co-context-free clique or anticlique, but not necessarily a context-free (let alone regular) clique or anticlique. We also show that uncountable omega-automatic ternary hypergraphs need not have uncountable cliques or anticliques at all.

Affiliated with

Also associated with

No associations

Rating

Is Ramsey's theorem omega-automatic? does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Is Ramsey's theorem omega-automatic?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Is Ramsey's theorem omega-automatic? will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-624335