Archives
Keywords
Monotonically far Non-saturation very good scale ccc tensor product graph club_AD sap projective Boolean algebra P-Ideal Dichotomy Almost-disjoint family Singular Density Respecting tree Knaster higher Baire space Rock n' Roll countably metacompact Coherent tree Minimal Walks Ostaszewski square Axiom R Prevalent singular cardinals S-Space Martin's Axiom Ineffable cardinal Strongly Luzin set Square-Brackets Partition Relations regressive Souslin tree Greatly Mahlo stationary reflection Universal Sequences Kurepa Hypothesis Whitehead Problem Commutative cancellative semigroups Diamond-sharp Analytic sets strongly bounded groups Parameterized proxy principle Well-behaved magma super-Souslin tree stationary hitting weak diamond Uniformization Ascent Path Shelah's Strong Hypothesis weak Kurepa tree Commutative projection system Constructible Universe Almost countably chromatic L-space Hindman's Theorem Reflecting stationary set Aronszajn tree Diamond for trees stick coloring number middle diamond Ascending path b-scale square principles Subtle cardinal Generalized Clubs square Souslin Tree Reduced Power Prikry-type forcing incompactness reflection principles Cohen real Almost Souslin Chromatic number Foundations SNR indecomposable filter Selective Ultrafilter Fodor-type reflection Knaster and friends nonmeager set Vanishing levels Successor of Regular Cardinal Nonspecial tree Iterated forcing Antichain Microscopic Approach Mandelbrot set Entangled linear order Erdos-Hajnal graphs Large Cardinals Generalized descriptive set theory OCA Filter reflection Singular cofinality Sigma-Prikry C-sequence Forcing polarized partition relation ZFC construction Fat stationary set Subnormal ideal positive partition relation Closed coloring Successor of Singular Cardinal PFA free Souslin tree Sierpinski's onto mapping principle GMA Partition relations for trees Subtle tree property Strongly compact cardinal Postprocessing function Dowker space Small forcing Chang's conjecture perfectly normal transformations Local Club Condensation. Uniformly homogeneous O-space 54G20 Luzin set weak square unbounded function Weakly compact cardinal Slim tree Hedetniemi's conjecture Countryman line approachability ideal Amenable C-sequence Jonsson cardinal Fast club Distributive tree free Boolean algebra Rainbow sets Sakurai's Bell inequality full tree Hereditarily Lindelöf space Cardinal function Forcing with side conditions Intersection model AIM forcing Dushnik-Miller Strong coloring xbox Uniformly coherent Was Ulam right? specializable Souslin tree Singular cardinals combinatorics Partition Relations Precaliber Diamond Erdos Cardinal Club Guessing Interval topology on trees Ulam matrix Absoluteness diamond star Rado's conjecture Lipschitz reduction Ramsey theory over partitions PFA(S)[S] Poset HOD Subadditive Cardinal Invariants Forcing Axioms Open Access
Tag Archives: Chromatic number
MFO workshop in Set Theory, February 2017
I gave an invited talk at the Set Theory workshop in Obwerwolfach, February 2017. Talk Title: Coloring vs. Chromatic. Abstract: In a joint work with Chris Lambie-Hanson, we study the interaction between compactness for the chromatic number (of graphs) and … Continue reading
Posted in Invited Talks
Tagged Chromatic number, coloring number, incompactness, stationary reflection
Leave a comment
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
INFTY Final Conference, March 2014
I gave an invited talk at the INFTY Final Conference meeting, Bonn, March 4-7, 2014. [Curiosity: Georg Cantor was born March 3, 1845] Title: Same Graph, Different Universe. Abstract: In a paper from 1998, answering a question of Hajnal, Soukup … Continue reading
Set Theory Programme on Large Cardinals and Forcing, September 2013
I gave an invited talk at the Large Cardinals and Forcing meeting, Erwin Schrödinger International Institute for Mathematical Physics, Vienna, September 23–27, 2013. Talk Title: Hedetniemi’s conjecture for uncountable graphs Abstract: It is proved that in Godel’s constructible universe, for … Continue reading
Posted in Invited Talks
Tagged Almost countably chromatic, Chromatic number, Hedetniemi's conjecture
1 Comment
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
The chromatic numbers of the Erdos-Hajnal graphs
Recall that a coloring $c:G\rightarrow\kappa$ of an (undirected) graph $(G,E)$ is said to be chromatic if $c(v_1)\neq c(v_2)$ whenever $\{v_1,v_2\}\in E$. Then, the chromatic number of a graph $(G,E)$ is the least cardinal $\kappa$ for which there exists a chromatic … Continue reading
Posted in Blog, Expository
Tagged Chromatic number, Erdos-Hajnal graphs, Rado's conjecture, reflection principles
14 Comments
