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