Generic automorphisms and graph coloring

DOI10.1016/j.disc.2004.04.030zbMath1058.03036OpenAlexW2052148223MaRDI QIDQ1772278

James H. Schmerl

Publication date: 18 April 2005

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2004.04.030

zbMATH Keywords

Peano ArithmeticHedetniemi's conjectureGeneric automorphismsRecursively saturated model

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Models of arithmetic and set theory (03C62)

Related Items

Automorphism groups of countable structures and groups of measurable functions ⋮ Automatic continuity, unique Polish topologies, and Zariski topologies on monoids and clones ⋮ CONSEQUENCES OF THE EXISTENCE OF AMPLE GENERICS AND AUTOMORPHISM GROUPS OF HOMOGENEOUS METRIC STRUCTURES ⋮ Turbulence, amalgamation, and generic automorphisms of homogeneous structures

Cites Work

• The chromatic number of the product of two 4-chromatic graphs is 4
• The chromatic number of the product of two \(\aleph _ 1\)-chromatic graphs can be countable
• On the arc-chromatic number of a digraph
• Generic automorphisms of the universal partial order
• Generic Automorphisms of Homogeneous Structures
• The Automorphism Group of an Arithmetically Saturated Model of Peano Arithmetic
• 25 pretty graph colouring problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item