Archives
Keywords
Countryman line Subtle tree property Closed coloring Precaliber Diamond-sharp countably metacompact weak Kurepa tree Lipschitz reduction Generalized Clubs super-Souslin tree Ascent Path Luzin set AIM forcing weak square HOD Analytic sets Ostaszewski square Square-Brackets Partition Relations Hindman's Theorem Respecting tree higher Baire space Singular Density PFA(S)[S] Shelah's Strong Hypothesis C-sequence Cardinal Invariants Knaster Slim tree Prevalent singular cardinals square Parameterized proxy principle very good scale Absoluteness Whitehead Problem Hereditarily Lindelöf space Large Cardinals Postprocessing function full tree Knaster and friends Antichain Reflecting stationary set Subnormal ideal b-scale Universal Sequences Intersection model Jonsson cardinal Rock n' Roll OCA Generalized descriptive set theory Almost Souslin Coherent tree Hedetniemi's conjecture Foundations Successor of Regular Cardinal nonmeager set Almost-disjoint family Cohen real Dushnik-Miller Weakly compact cardinal Reduced Power Constructible Universe free Souslin tree Aronszajn tree ZFC construction Uniformly homogeneous Local Club Condensation. coloring number Poset stationary hitting Prikry-type forcing Non-saturation PFA incompactness Well-behaved magma Open Access Small forcing L-space Ramsey theory over partitions Forcing polarized partition relation Fodor-type reflection Fat stationary set Cardinal function O-space Nonspecial tree Ulam matrix transformations Diamond for trees stationary reflection diamond star positive partition relation strongly bounded groups Fast club Filter reflection Chromatic number Kurepa Hypothesis reflection principles Forcing Axioms free Boolean algebra Commutative projection system square principles Sierpinski's onto mapping principle unbounded function Successor of Singular Cardinal Subtle cardinal Diamond 54G20 Selective Ultrafilter Distributive tree Singular cofinality Dowker space Commutative cancellative semigroups Strongly compact cardinal specializable Souslin tree Amenable C-sequence indecomposable ultrafilter stick Vanishing levels SNR ccc Uniformly coherent Erdos-Hajnal graphs Mandelbrot set projective Boolean algebra GMA Martin's Axiom Greatly Mahlo Was Ulam right regressive Souslin tree sap Rainbow sets Subadditive P-Ideal Dichotomy Sakurai's Bell inequality xbox Sigma-Prikry Erdos Cardinal Uniformization middle diamond Souslin Tree Strong coloring Chang's conjecture Club Guessing Axiom R Partition Relations S-Space Singular cardinals combinatorics Microscopic Approach approachability ideal Almost countably chromatic tensor product graph Strongly Luzin set Rado's conjecture weak diamond club_AD Ineffable cardinal Minimal Walks Iterated forcing
Tag Archives: 05C63
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
