Skip to main content
SpringerLink
Log in

A note on chromatic number and connectivity of infinite graphs

  • Published:
Israel Journal of Mathematics Aims and scope Submit manuscript

Abstract

Consistently there exists an uncountably chromatic graph of cardinality ℵ1 which does not contain an uncountable infinitely connected subgraph.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. P. Erdős and A. Hajnal, On chromatic number of graphs and set-systems, Acta Mathematica Academiae Scientiarum Hungaricae 17 (1966), 61–99.

    Article  MathSciNet  Google Scholar 

  2. P. Erdős and R. Rado, Partition relations connected with chromatic number of graphs, Journal of the London Mathematical Society 34 (1959), 63–72.

    Article  Google Scholar 

  3. P. Erdős and R. Rado, A construction of graphs without triangles having pre-assigned order and chromatic number, Journal of the London Mathematical Society 35 (1960), 445–448

    Article  Google Scholar 

  4. A. Hajnal, A negative partition relation, Proceedings of the National Academy of Sciences of the United States of America 68 (1971), 142–144.

    Article  MathSciNet  MATH  Google Scholar 

  5. P. Komjáth, Connectivity and chromatic number of infinite graphs, Israel Journal of Mathematics 56 (1986), 257–266.

    Article  MathSciNet  MATH  Google Scholar 

  6. P. Komjáth, Consistency results on infinite graphs, Israel Journal of Mathematics 61 (1988), 285–294.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Eötvös University, Budapest, P.O.Box 120, 1518, Hungary

    Péter Komjáth

Authors
  1. Péter Komjáth
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Péter Komjáth.

Additional information

Research partially supported by Hungarian National Research Grant K 81121.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Komjáth, P. A note on chromatic number and connectivity of infinite graphs. Isr. J. Math. 196, 499–506 (2013). https://doi.org/10.1007/s11856-012-0176-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11856-012-0176-z

Keywords

Search

Navigation