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