Generic graph construction
Journal of Symbolic Logic 49 (1):234-240 (1984)
| Abstract | It is shown that if ZF is consistent, then so is ZFC + GCH + "There is a graph with cardinality ℵ 2 and chromatic number ℵ 2 such that every subgraph of cardinality ≤ ℵ 1 has chromatic number ≤ ℵ 0 ". This partially answers a question of Erdos and Hajnal | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,701 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesEero Hyvönen (1986). Applying a Logical Interpretation of Semantic Nets and Graph Grammars to Natural Language Parsing and Understanding. Synthese 66 (1):177 - 190.
John M. Harris, Jeffry L. Hirst & Michael J. Mossinghoff (2008). Combinatorics and Graph Theory. Springer.
Steve Warner (2001). The Cofinality of the Random Graph. Journal of Symbolic Logic 66 (3):1439-1446.
Rafael de Clercq (2012). On Some Putative Graph-Theoretic Counterexamples to the Principle of the Identity of Indiscernibles. Synthese 187 (2):661-672.
J. C. E. Dekker (1981). Twilight Graphs. Journal of Symbolic Logic 46 (3):539-571.
Rainer Kerth (1998). Isomorphism and Equational Equivalence of Continuous Λ-Models. Studia Logica 61 (3):403-415.
Harold Schellinx (1991). Isomorphisms and Nonisomorphisms of Graph Models. Journal of Symbolic Logic 56 (1):227-249.
Dwight R. Bean (1976). Effective Coloration. Journal of Symbolic Logic 41 (2):469-480.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads2 ( #232,501 of 549,090 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
