Finite subgraphs of uncountably chromatic graphs

Details Finite subgraphs of uncountably chromatic graphs Finite subgraphs of uncountably chromatic graphs

2002-12-04

arxiv.org/abs/math/0212064v1

Mathematics

Logic

Scientific paper

It is consistent that for every monotonically increasing function f:omega->omega there is a graph with size and chromatic number aleph_1 in which every n-chromatic subgraph has at least f(n) elements (n >= 3). This solves a $250 problem of Erdos. It is also consistent that there is a graph X with Chr(X)=|X|= aleph_1 such that if Y is a graph all whose finite subgraphs occur in X then Chr(Y)<=aleph_2 (so the Taylor conjecture may fail).

Affiliated with

Also associated with

No associations

Rating

Finite subgraphs of uncountably chromatic graphs 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 Finite subgraphs of uncountably chromatic graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finite subgraphs of uncountably chromatic graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-265009