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