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