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