What must and what need not be contained in a graph of uncountable chromatic number?-Reference-Cited by-同舟云学术

What must and what need not be contained in a graph of uncountable chromatic number?

Published:1984-03 Issue:1 Volume:4 Page:47-52
ISSN:0209-9683
Container-title:Combinatorica
language:en
Short-container-title:Combinatorica

Author:

Hajnal András,Komjáth Péter

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Discrete Mathematics and Combinatorics

Link

http://link.springer.com/content/pdf/10.1007/BF02579156.pdf

Reference11 articles.

1. P. Erdős, Graph theory and probability,Canad. J. Math. 11 (1959), 34–38.

2. P. Erdős, F. Galvin andA. Hajnal, On set systems having large chromatic numbers and not containing prescribed subsystems,Coll. Math. Soc. János Bolyai 10,Infinite and Finite Sets, Keszthely (Hungary) 1973, 425–513.

3. P. Erdős andA. Hajnal, On chromatic number of graphs and set-systems,Acta Math. Acad. Sci. Hung. 17 (1966), 61–99.

4. P. Erdős, A. Hajnal andS. Shelah, On some general properties of chromatic numbers,Coll. Math. Soc. János Bolyai 8,Topics in Topology, Keszthely, (Hungary) 1973, 243–255.

5. P. Erdős andR. Rado, A construction of graphs without triangles having pre-assigned order and chromatic number,Journal of the London Math. Soc. 35 (1960), 445–448.

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Hajnal–Máté graphs, Cohen reals, and disjoint‐type guessing;Mathematika;2024-05-28

2. Infinite stable graphs with large chromatic number II;Journal of the European Mathematical Society;2023-06-14

3. Infinite stable graphs with large chromatic number;Transactions of the American Mathematical Society;2021-12-21

4. Orientations of graphs with uncountable chromatic number;Journal of Graph Theory;2017-12-26

5. Infinitely connected subgraphs in graphs of uncountable chromatic number;Combinatorica;2016-05-10