Universal graphs without large cliques

Details Universal graphs without large cliques Universal graphs without large cliques

1993-08-15

arxiv.org/abs/math/9308221v1

J. Combin. Theory Ser. B 63 (1995), 125--135

Mathematics

Logic

Scientific paper

We give some existence/nonexistence statements on universal graphs, which under GCH give a necessary and sufficient condition for the existence of a universal graph of size lambda with no K(kappa), namely, if either kappa is finite or cf(kappa)>cf(lambda). (Here K(kappa) denotes the complete graph on kappa vertices.) The special case when lambda^{< kappa}= lambda was first proved by F. Galvin. Next, we investigate the question that if there is no universal K(kappa)-free graph of size lambda then how many of these graphs embed all the other. It was known, that if lambda^{< lambda}= lambda (e.g., if lambda is regular and the GCH holds below lambda), and kappa = omega, then this number is lambda^+. We show that this holds for every kappa <= lambda of countable cofinality. On the other hand, even for kappa = omega_1, and any regular lambda >= omega_1 it is consistent that the GCH holds below lambda, 2^{lambda} is as large as we wish, and the above number is either lambda^+ or 2^{lambda}, so both extremes can actually occur.

Affiliated with

Also associated with

No associations

Rating

Universal graphs without large cliques 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 Universal graphs without large cliques, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Universal graphs without large cliques will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-228698