Related papers: Universal countably chromatic graph
We show a number of undecidable assertions concerning countably compact spaces hold under PFA(S)[S]. We also show the consistency without large cardinals of "every locally compact, perfectly normal space is paracompact".
In the mid-1990s, Stanley and Stembridge conjectured that the chromatic symmetric functions of claw-free co-comparability (also called incomparability) graphs were e-positive. The quest for the proof of this conjecture has led to an…
We prove from suitable large cardinal hypotheses that the least weakly compact cardinal can be unfoldable, weakly measurable and even nearly $\theta$-supercompact, for any desired $\theta$. In addition, we prove several global results…
Let kappa be a regular uncountable cardinal and lambda >=kappa^+ . The principle of stationary reflection for P_kappa lambda has been successful in settling problems of infinite combinatorics in the case kappa=omega_1. For a greater kappa…
Assuming the Continuum Hypothesis, there is a compact first countable connected space of weight aleph_1 with no totally disconnected perfect subsets. Each such space, however, may be destroyed by some proper forcing order which does not add…
Let T be a complete, first-order theory in a finite or countable language having infinite models. Let I(T,kappa) be the number of isomorphism types of models of T of cardinality \kappa. We denote by \mu (respectively \hat\mu) the number of…
We prove that for any graph $G$, the total chromatic number of $G$ is at most $\Delta(G)+2\left\lceil \frac{|V(G)|}{\Delta(G)+1} \right\rceil$. This saves one color in comparison with a result of Hind from 1992. In particular, our result…
We supply an upper bound on the distinguishing chromatic number of certain infinite graphs satisfying an adjacency property. Distinguishing proper $n$-colourings are generalized to the new notion of distinguishing homomorphisms. We prove…
To each colored graph, one can associate its closure in the universal space of isomorphism classes of pointed colored graphs, and this subspace can be regarded as a generalized subshift. Based on this correspondence, we extend the notion of…
Under large cardinal hypotheses beyond the Kunen inconsistency -- hypotheses so strong as to contradict the Axiom of Choice -- we solve several variants of the generalized continuum problem and identify structural features of the levels…
W.H. Woodin showed that if $\kappa_1 < \cdots < \kappa_n$ are strong cardinals then two-step ${\bf\Sigma}^1_{n+3}$ generic absoluteness holds after collapsing $2^{2^{\kappa_n}}$ to be countable. We show that this number can be reduced to…
We explore a general method based on trees of elementary submodels in order to present highly simplified proofs to numerous results in infinite combinatorics. While countable elementary submodels have been employed in such settings already,…
We consider when the universal $C^*$-algebras associated to edge-colored directed graphs are exact. Specifically, for countable edge-colored directed graphs we show that the universal $C^*$-algebra is exact if and only if the $C^*$-algebra…
The current paper answers an open question of abs/1007.2426 We say that a countable model M characterizes an infinite cardinal kappa, if the Scott sentence of M has a model in cardinality kappa, but no models in cardinality kappa plus. If M…
A 1-selection $f$ of a graph $G$ is a function $f: V(G)\rightarrow E(G)$ such that $f(v)$ is incident to $v$ for every vertex $v$. The 1-removed $G_f$ is the graph $(V(G),E(G)\setminus f[V(G)])$. The (1-)robust chromatic number $\chi_1(G)$…
Relative to class many supercompact cardinals, we construct a model of $\ZFC+\GCH$ where for every singular cardinal $\delta$ of countable cofinality and every regular uncountable $\mu<\delta$ there are stationarily many non-approachable…
We exhibit infinite families of planar graphs with real chromatic roots arbitrarily close to 4, thus resolving a long-standing conjecture in the affirmative.
A cubelike graph is a Cayley graph on the product $\mathbb{Z}_2\times\cdots\times\mathbb{Z}_2$ of the integers modulo $2$ with itself finitely many times. In 1992, Payan proved that no cubelike graph can have chromatic number $3$. The…
We classify the countable ultrahomogeneous 2-vertex-colored graphs in which the color classes are imprimitive, i.e., up to complementation they form disjoint unions of cliques. This generalizes work by Jenkinson, Lockett and Truss as well…
We show in this paper that a split-comparability graph $G$ has chromatic index equal to $\Delta(G) + 1$ if and only if $G$ is neighborhood-overfull. That implies the validity of the Overfull Conjecture for the class of split-comparability…