On the order of countable graphs

2004/04/18 by Jaroslav Nešetřil, Saharon Shelah
Mathematics · #math.LO #math.CO

paper · pdf

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

arxiv created 2004/04/18 · arxiv updated 2009/12/01

Abstract

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.

Related

• A new method for enumerating independent sets of a fixed size in general graphs
• Counting independent sets in strongly orderable graphs
• Counting independent sets in structured graphs
• Independent sets in graphs with given minimum degree
• Maximizing the number of maximal independent sets of a fixed size