Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
Hostname: page-component-cd9895bd7-7cvxr Total loading time: 0 Render date: 2024-12-22T20:21:13.329Z Has data issue: false hasContentIssue false

A Theorem on Countable Ordered Sets with an Application to Universal Graphs

Published online by Cambridge University Press:  31 March 2017

By
Péter Komjáth
Edited by
Samuel R. Buss ,
Petr Hájek  and
Pavel Pudlák
Péter Komjáth
Affiliation:
Calgary University, Calgary, Alberta, Canada
Samuel R. Buss
Affiliation:
University of California, San Diego
Petr Hájek
Affiliation:
Academy of Sciences of the Czech Republic, Prague
Pavel Pudlák
Affiliation:
Academy of Sciences of the Czech Republic, Prague
Get access
Type
Chapter
Information
Logic Colloquium '98 , pp. 296 - 301
Publisher: Cambridge University Press
Print publication year: 2000

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

1. Cherlin, G. Shelah, S. Shi|N. Universal graphs with forbidden graphs and algebraic closure, (to appear)
2. Cherlin, G. Shi, N.: Graphs omitting sums of complete graphs. Journal of Graph Theory 24 (1997) 237–247Google Scholar
3. Cherlin, G. Shi, N. Tallgren|L. Graphs omitting a bushy tree. Journal of Graph Theory 26 (1997) 203–210Google Scholar
4. Erdʺos, P. Hajnal, A.:On a classification of denumerable order types and an application to the partition calculus. Fundamenta Mathematicae 51 (1962) 117–129Google Scholar
5. Füredi, Z. Komjáth, P. :On the existence of countable universal graphs. Journal of Graph Theory 25 (1997) 53–58Google Scholar
6. Füredi, Z. Komjáth, P.:Nonexistence of universal graphs without some trees. Combinatorica 17 (1997) 163–171Google Scholar
7. Hausdorff, F.:Grundzüge einer Theorie der GeordneteMengen.Math.Ann. 65 (1908) 435–505Google Scholar
8. Komjáth, P. Pach, J.: Universal elements and the complexity of certain classes of infinite graphs. Discrete Math. 95 (1991) 255–270Google Scholar
9. Komjáth, P. Shelah, S.|: Universal graphs without large cliques, J.Comb. Th (B) (1995) 125–135
10. Laver, R.: On Fraıssé's order type conjecture. Ann. Math. 93 (1971) 89–111Google Scholar
11. Rado, R.: Universal graphs and universal functions. Acta Arithmetica 9 (1964) 331–340.Google Scholar
12. Rado, R.: Universal graphs, in: A seminar in graph theory, (Harary and Beineke, eds.), Holt, Rinehart and Winston Co., 1967
13. Joseph G., Rosenstein: Linear orderings, Academic Press, 1982.

Save book to Kindle

To save this book to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×