Same Graph, Different Universe

Abstract. May the same graph admit two different chromatic numbers in two different universes? how about infinitely many different values? and can this be achieved without changing the cardinals structure?

In this paper, it is proved that in Godel’s constructible universe, for every uncountable cardinal $\lambda$ below the first fixed-point of the $\aleph$-function, there exists a graph $\mathcal G_\lambda$ satisfying the following:

  • $\mathcal G_\lambda$ has size and chromatic number $\lambda$;
  • for every infinite cardinal $\kappa<\lambda$, there exists a cofinality-preserving, GCH-preserving forcing extension in which $\text{chr}(\mathcal G_\lambda)=\kappa$.

Downloads:

[No arXiv entry][No entry on mathscinet]

This entry was posted in Infinite Graphs, Publications and tagged , , , , , , , . Bookmark the permalink.

10 Responses to Same Graph, Different Universe

  1. Same same, but different.

       0 likes

  2. Mike Pawliuk says:

    This reminds me of some theorems of Shelah and Soifer (in “Axiom of choice and chromatic number: examples on the plane.”) where they construct a graph that has different chromatic numbers depending on the truth of AC.

    There are also some survey articles about this. Like this one by MS Payne.

    http://arxiv.org/pdf/0707.1177.pdf

       1 likes

    • saf says:

      Thanks, Mike! How cool is that! I’ll incorporate this info to the paper (maybe tomorrow).

      p.s.
      The fact that chromatic numbers are sensitive to the axiom of choice is also witnessed by this curious theorem of Galvin and Komjath.

         0 likes

    • saf says:

      A new version that discusses work as of Shelah-Soifer has been uploaded. Thanks again, Mike!

         0 likes

  3. saf says:

    Submitted to the special issue in memory of Jim Baumgartner, November 2014.
    Accepted, September 2015.

       1 likes

  4. Literature says:

    I notice that neither your paper nor the blog is aware of the graph G_0 of Kechris-Solecki-Todorcevic (1999). This graph is acyclic but it has uncountable Baire-chromatic number.

       1 likes

    • saf says:

      The study of Borel chromatic numbers in general, and the minimal graph $G_0$ are very interesting, but this particular paper does not concentrate on this line of study. I only gave one quick-and-simple example in this vein to demonstrate the role of the axiom of choice in the study of chromatic numbers, and to stress that I will only be interested in ZFC extensions of L.

         0 likes

    • saf says:

      Since you already happened to glance over the paper, let me mention that it is open whether the fixed point limitation in the statement of the main theorem may be waived.

         0 likes

  5. Literature says:

    The graph G_0 is put forward to your blog because you got excited by the result of Shelah and Soifer which studies the effect of the axiom of choice on the value of a given graph. The earlier paper KST1999 gives the right mathematical explanation of this phenomenon and moreover gives also two universes in which the same graph has different chromatic numbers, the universes that could be built on the basis of the consistency of ZFC rather than ZFC plus an inaccessible.

       0 likes

Leave a Reply

Your email address will not be published. Required fields are marked *