Small universal families for graphs omitting cliques without GCH

Archive for Mathematical Logic 49 (7-8):799-811 (2010)
  Copy   BIBTEX

Abstract

When no single universal model for a set of structures exists at a given cardinal, then one may ask in which models of set theory does there exist a small family which embeds the rest. We show that for λ+-graphs (λ regular) omitting cliques of some finite or uncountable cardinality, it is consistent that there are small universal families and 2λ > λ+. In particular, we get such a result for triangle-free graphs

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,758

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Some coinductive graphs.A. H. Lachlan - 1990 - Archive for Mathematical Logic 29 (4):213-229.
Forbidden subgraphs and forbidden substructures.Gregory Cherlin & Niandong Shi - 2001 - Journal of Symbolic Logic 66 (3):1342-1352.
Universality for Orders and Graphs Which Omit Large Substructures.Katherine Thompson - 2006 - Notre Dame Journal of Formal Logic 47 (2):233-248.
On the existence of universal models.Mirna Džamonja & Saharon Shelah - 2004 - Archive for Mathematical Logic 43 (7):901-936.
Twilight graphs.J. C. E. Dekker - 1981 - Journal of Symbolic Logic 46 (3):539-571.
Some natural decision problems in automatic graphs.Dietrich Kuske & Markus Lohrey - 2010 - Journal of Symbolic Logic 75 (2):678-710.
Expansions of Ultrahomogeneous Graphs.J. E. Helmreich - 1995 - Notre Dame Journal of Formal Logic 36 (3):414-424.
Finitely constrained classes of homogeneous directed graphs.Brenda J. Latka - 1994 - Journal of Symbolic Logic 59 (1):124-139.
Reverse mathematics and infinite traceable graphs.Peter Cholak, David Galvin & Reed Solomon - 2012 - Mathematical Logic Quarterly 58 (1-2):18-28.
.Jay Zeman - unknown
Domatic partitions of computable graphs.Matthew Jura, Oscar Levin & Tyler Markkanen - 2014 - Archive for Mathematical Logic 53 (1-2):137-155.
Graphs with ∏ 1 0 (K)Y-sections.Boško Živaljević - 1993 - Archive for Mathematical Logic 32 (4):259-273.

Analytics

Added to PP
2013-11-23

Downloads
9 (#1,274,987)

6 months
1 (#1,507,095)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Perfect-set forcing for uncountable cardinals.Akihiro Kanamori - 1980 - Annals of Mathematical Logic 19 (1-2):97-114.
Perfect trees and elementary embeddings.Sy-David Friedman & Katherine Thompson - 2008 - Journal of Symbolic Logic 73 (3):906-918.
On universal graphs without instances of CH.Saharon Shelah - 1984 - Annals of Pure and Applied Logic 26 (1):75-87.

View all 9 references / Add more references