Forbidden subgraphs and forbidden substructures

Journal of Symbolic Logic

Volumn 66, Issue 3, 2001, Pages 1342-1352

  Cherlin, Gregory ^a   Shi, Niandong ^a,b  

^a RUTGERS UNIVERSITY   (United States)

^b EAST STROUDSBURG UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035633479     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2307/2695110     Document Type: Article

References (6)

1. G. CHERLIN, S. SHELAH, and N. SHI, Universal graphs and algebraic closure, Advances in Applied Mathematics, vol. 22 (1999), pp. 454-491.
2. G. CHERLIN and N. SHI, Graphs omitting a finite set of cycles, Journal of Graph Theory, vol. 21 (1996), pp. 351-355.
3. Z. FÜREDI and P. KOMJÁTH, On the existence of countable universal graphs, Journal of Graph Theory, vol. 25 (1997), pp. 53-58.
4. A. S. KAHR, E. F. MOORE, and H. WANG, Entscheidungsproblem reduced to the ∀∃∀ case, Proceedings of the National Academy of Sciences of the United States of America, vol. 48 (1962), pp. 365-377.
5. P. KOMJÁTH, A. MEKLER, and J. PACH, Some universal graphs, Israel Journal of Mathematics, vol. 64 (1988), pp. 158-168.
6. P. KOMJÁTH and J. PACH, Universal elements and the complexity of certain classes of infinite graphs, Discrete Mathematics, vol. 95 (1991), pp. 255-270.