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