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