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