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