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