메뉴 건너뛰기




Volumn 291, Issue 1-3, 2005, Pages 235-242

Generic automorphisms and graph coloring

Author keywords

Generic automorphisms; Hedetniemi's conjecture; Peano Arithmetic; Recursively saturated

Indexed keywords

COLORING; DIGITAL ARITHMETIC; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; SET THEORY; THEOREM PROVING;

EID: 14544304043     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2004.04.030     Document Type: Conference Paper
Times cited : (8)

References (12)
  • 1
    • 0003395274 scopus 로고
    • Oligomorphic Permutation Groups, Cambridge University Press Cambridge
    • P.J. Cameron Oligomorphic Permutation Groups, London Math. Soc. Lecture Notes 1990 Cambridge University Press Cambridge
    • (1990) London Math. Soc. Lecture Notes
    • Cameron, P.J.1
  • 2
    • 51249171151 scopus 로고
    • The chromatic number of the two 4-chromatic graphs is 4
    • M. El-Zahar, and N.W. Sauer The chromatic number of the two 4-chromatic graphs is 4 Combinatorica 5 1985 121 126
    • (1985) Combinatorica , vol.5 , pp. 121-126
    • El-Zahar, M.1    Sauer, N.W.2
  • 3
    • 0041011114 scopus 로고
    • Examples of N0-categorical product of structures
    • R. Kaye D. Macpherson Oxford Science Publications Clarendon Press, Oxford
    • D.M. Evans Examples of א 0 -categorical product of structures R. Kaye D. Macpherson Automorphisms of First-Order Structures 1994 Oxford Science Publications Clarendon Press, Oxford 33 72
    • (1994) Automorphisms of First-Order Structures , pp. 33-72
    • Evans, D.M.1
  • 4
    • 51249173222 scopus 로고
    • The chromatic number of the product of two N1-chromatic graphs can be countable
    • A. Hajnal The chromatic number of the product of two א 1 -chromatic graphs can be countable Combinatorica 5 1985 137 139
    • (1985) Combinatorica , vol.5 , pp. 137-139
    • Hajnal, A.1
  • 7
    • 0001686961 scopus 로고
    • The automorphism group of an arithmetically saturated model of Peano Arithmetic
    • R. Kossak, and J.H. Schmerl The automorphism group of an arithmetically saturated model of Peano Arithmetic J. London Math. Soc. 52 1995 235 244
    • (1995) J. London Math. Soc. , vol.52 , pp. 235-244
    • Kossak, R.1    Schmerl, J.H.2
  • 8
    • 23044530293 scopus 로고    scopus 로고
    • Generic automorphisms of the universal partial order
    • D. Kuske, and J.K. Truss Generic automorphisms of the universal partial order Proc. Amer. Math. Soc. 129 2001 1939 1948
    • (2001) Proc. Amer. Math. Soc. , vol.129 , pp. 1939-1948
    • Kuske, D.1    Truss, J.K.2
  • 9
    • 0002977246 scopus 로고
    • The small index property and recursively saturated models of Peano arithmetic
    • R. Kaye D. Macpherson Oxford Science Publications Clarendon Press, Oxford
    • D. Lascar The small index property and recursively saturated models of Peano arithmetic R. Kaye D. Macpherson Automorphisms of First-Order Structures 1994 Oxford Science Publications Clarendon Press, Oxford 281 292
    • (1994) Automorphisms of First-Order Structures , pp. 281-292
    • Lascar, D.1
  • 10
    • 0041513365 scopus 로고
    • Coloring digraphs by iterated antichains
    • S. Poljak Coloring digraphs by iterated antichains Comment. Math. Univ. Carolinae 32 1991 209 212
    • (1991) Comment. Math. Univ. Carolinae , vol.32 , pp. 209-212
    • Poljak, S.1
  • 11
    • 0010113806 scopus 로고
    • On the arc chromatic number of a digraph
    • S. Poljak, and V. Rödl On the arc chromatic number of a digraph J. Combin. Theory Ser. (B) 31 1981 190 198
    • (1981) J. Combin. Theory Ser. (B) , vol.31 , pp. 190-198
    • Poljak, S.1    Rödl, V.2
  • 12
    • 84963028434 scopus 로고
    • Generic automorphisms of homogeneous structures
    • J. Truss Generic automorphisms of homogeneous structures Proc. London Math. Soc. 65 1992 121 141
    • (1992) Proc. London Math. Soc. , vol.65 , pp. 121-141
    • Truss, J.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.