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