Archives
Keywords
Diamond Poset Hedetniemi's conjecture Rainbow sets Axiom R Parameterized proxy principle Small forcing Uniformly homogeneous b-scale regressive Souslin tree projective Boolean algebra OCA Erdos-Hajnal graphs ccc Rock n' Roll unbounded function Greatly Mahlo reflection principles PFA GMA PFA(S)[S] nonmeager set tensor product graph Singular cofinality weak Kurepa tree club_AD Kurepa Hypothesis Non-saturation Minimal Walks Successor of Singular Cardinal Microscopic Approach Square-Brackets Partition Relations Rado's conjecture stationary hitting Slim tree HOD Lipschitz reduction stick Whitehead Problem very good scale weak diamond Almost countably chromatic Strong coloring Postprocessing function transformations Singular cardinals combinatorics Ramsey theory over partitions indecomposable ultrafilter Souslin Tree diamond star Fast club Amenable C-sequence Dushnik-Miller Generalized Clubs Iterated forcing Distributive tree Knaster Fat stationary set super-Souslin tree Forcing Axioms Subtle cardinal Filter reflection Erdos Cardinal Uniformization free Boolean algebra S-Space Absoluteness Subtle tree property Closed coloring Was Ulam right Mandelbrot set strongly bounded groups SNR free Souslin tree stationary reflection full tree AIM forcing Chang's conjecture Strongly Luzin set incompactness Antichain Successor of Regular Cardinal Constructible Universe square Almost Souslin Forcing C-sequence Fodor-type reflection Knaster and friends Cardinal Invariants specializable Souslin tree Analytic sets Local Club Condensation. Jonsson cardinal polarized partition relation Well-behaved magma O-space Ostaszewski square Ascent Path Vanishing levels Subadditive Weakly compact cardinal Commutative cancellative semigroups Prikry-type forcing Sigma-Prikry Ulam matrix higher Baire space Reflecting stationary set Generalized descriptive set theory square principles Uniformly coherent weak square Large Cardinals ZFC construction P-Ideal Dichotomy middle diamond Club Guessing Shelah's Strong Hypothesis Aronszajn tree xbox Selective Ultrafilter Hindman's Theorem L-space Dowker space Reduced Power Prevalent singular cardinals Singular Density Nonspecial tree Martin's Axiom coloring number countably metacompact Almost-disjoint family Foundations Cohen real Sierpinski's onto mapping principle Luzin set Chromatic number Universal Sequences Partition Relations approachability ideal Sakurai's Bell inequality Ineffable cardinal Coherent tree Diamond-sharp Diamond for trees 54G20 Open Access Hereditarily Lindelöf space positive partition relation Cardinal function Precaliber Subnormal ideal sap
Tag Archives: 05C15
Reflection on the coloring and chromatic numbers
Joint work with Chris Lambie-Hanson. Abstract. We prove that reflection of the coloring number of graphs is consistent with non-reflection of the chromatic number. Moreover, it is proved that incompactness for the chromatic number of graphs (with arbitrarily large gaps) … Continue reading
Posted in Compactness, Infinite Graphs, Publications
Tagged 03E35, 05C15, 05C63, Chang's conjecture, Chromatic number, coloring number, Fodor-type reflection, incompactness, Iterated forcing, Parameterized proxy principle, Postprocessing function, Rado's conjecture, square, stationary reflection
2 Comments
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 … Continue reading
Posted in Infinite Graphs, Publications
Tagged 03E35, 05C15, 05C63, approachability ideal, Chromatic number, Constructible Universe, Forcing, Ostaszewski square
10 Comments
Hedetniemi’s conjecture for uncountable graphs
Abstract. It is proved that in Godel’s constructible universe, for every successor cardinal $\kappa$, there exist graphs $\mathcal G$ and $\mathcal H$ of size and chromatic number $\kappa$, for which the tensor product graph $\mathcal G\times\mathcal H$ is countably chromatic. … Continue reading
Chromatic numbers of graphs – large gaps
Abstract. We say that a graph $G$ is $(\aleph_0,\kappa)$-chromatic if $\text{Chr}(G)=\kappa$, while $\text{Chr}(G’)\le\aleph_0$ for any subgraph $G’$ of $G$ of size $<|G|$. The main result of this paper reads as follows. If $\square_\lambda+\text{CH}_\lambda$ holds for a given uncountable cardinal $\lambda$, … Continue reading
Posted in Compactness, Infinite Graphs, Publications
Tagged 03E35, 05C15, 05C63, Almost countably chromatic, Chromatic number, incompactness, Ostaszewski square
6 Comments