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