On the connectivity of infinite graphs

被引:0
作者
P. Komjáth
机构
[1] Eötvös Loránd University,Institute of Mathematics
来源
Acta Mathematica Hungarica | 2018年 / 154卷
关键词
infinite graph; chromatic number; connectivity; 03E05; 05C15; 05C40;
D O I
暂无
中图分类号
学科分类号
摘要
Let μ≥ω\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mu \geq \omega}$$\end{document} be regular, assume the Generalized Continuum Hypothesis and the principle □λ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\square_\lambda}$$\end{document} holds for every singular λ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\lambda}$$\end{document} with cf(λ)≤μ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\rm cf}(\lambda) \leq \mu}$$\end{document}. Let X be a graph with chromatic number greater than μ+\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mu^+}$$\end{document}. Then X contains a μ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mu}$$\end{document}-connected subgraph Y of X whose chromatic number is greater than μ+\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mu^+}$$\end{document}.
引用
收藏
页码:215 / 222
页数:7
相关论文
共 4 条
[1]  
Komjáth P.(1986)Connectivity and chromatic number of infinite graphs Israel J. Math., 56 257-266
[2]  
Komjáth P.(1987)The colouring number J. London Math. Soc., 54 1-14
[3]  
Komjáth P.(1988)Consistency results on infinite graphs Israel J. Math., 61 285-294
[4]  
Shelah S.(1975)A compactness theorem in singular cardinals, free algebras, Whitehead problem, and transversals Israel J. Math., 21 319-349