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