Hostname: page-component-586b7cd67f-gb8f7 Total loading time: 0 Render date: 2024-11-29T18:57:54.366Z Has data issue: false hasContentIssue false
  • English
  • Français

A note on minors of uncountable graphs*

Published online by Cambridge University Press:  24 October 2008

Péter Komjáth
Péter Komjáth
Affiliation:
Department of Computer Science, Eötvös University, Budapest, Múzeum krt 6–8, 1088, Hungary
Get access Rights & Permissions [Opens in a new window]

Abstract

If λ > ω then there are 2λ graphs of cardinal λ none of them being a minor of another.

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 117 , Issue 1 , January 1995 , pp. 7 - 9
Copyright
Copyright © Cambridge Philosophical Society 1995

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Kunen, K.. Set Theory. Studies in Logic 102, (North-Holland, 1980).Google Scholar
[2]Oporowski, B.. A counterexample to Seymour's self-minor conjecture. Journal of Graph Theory 14 (1990), 512–524.CrossRefGoogle Scholar
[3]Solovay, R.. Real-valued measurable cardinals. In Axiomatic Set Theory, Proc. Symp. Pure Math. 13, I (Scott, D., ed.), 1974, 365–372.Google Scholar
[4]Thomas, R.. A counter-example to ‘Wagner's conjecture’ for infinite graphs. Math. Proc. Cambridge Phil. Soc. 103 (1988), 55–57.CrossRefGoogle Scholar