On the order of countable graphs

Details On the order of countable graphs On the order of countable graphs

2004-04-18

arxiv.org/abs/math/0404319v1

European Journal of Combinatorics, 24(2003):649-663

Mathematics

Logic

Scientific paper

A set of graphs is said to be independent if there is no homomorphism between distinct graphs from the set. We consider the existence problems related to the independent sets of countable graphs. While the maximal size of an independent set of countable graphs is 2^omega the On Line problem of extending an independent set to a larger independent set is much harder. We prove here that singletons can be extended (``partnership theorem''). While this is the best possible in general, we give structural conditions which guarantee independent extensions of larger independent sets. This is related to universal graphs, rigid graphs and to the density problem for countable graphs.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-275373