On Taylor's problem

Mathematics – Logic

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

We describe some (countably many) classes K^{n,e} of finite graphs and prove that if lambda^{aleph_0}= lambda then every lambda^+-chromatic graph of cardinal lambda^+ contains, for some n, e, all members of K^{n,e} as subgraphs. On the other hand, it is consistent for every regular infinite cardinal kappa that there is a kappa^+-chromatic graph on kappa^+ that contains finite subgraphs only from K^{n,e} .

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

On Taylor's problem 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 On Taylor's problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Taylor's problem will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-197340

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.