Minimal functions on the random graph

DOI10.1007/s11856-014-1042-yzbMath1292.05231arXiv1003.4030OpenAlexW2963197653MaRDI QIDQ2017162

Manuel Bodirsky, Michael Pinsker

Publication date: 25 June 2014

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1003.4030

zbMATH Keywords

Ramsey-type theorem

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Random matrices (probabilistic aspects) (60B20) Generalized Ramsey theory (05C55)

Related Items (17)

A counterexample to the reconstruction of \(\omega\)-categorical structures from their endomorphism monoid ⋮ Galois theory for semiclones ⋮ Infinitely many reducts of homogeneous structures ⋮ The 42 reducts of the random ordered graph ⋮ THE REDUCTS OF THE HOMOGENEOUS BINARY BRANCHING C-RELATION ⋮ Reducts of the random partial order ⋮ Permutations on the random permutation ⋮ Solving equation systems in ω-categorical algebras ⋮ Reducts of the Henson graphs with a constant ⋮ Overgroups of the Automorphism Group of the Rado Graph ⋮ A survey of homogeneous structures ⋮ Schaefer's Theorem for Graphs ⋮ Pseudo‐loop conditions ⋮ Permutation groups containing infinite symplectic linear groups and reducts of linear spaces over the two element field ⋮ Constraint Satisfaction Problems for Reducts of Homogeneous Graphs ⋮ PROJECTIVE CLONE HOMOMORPHISMS ⋮ The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• More sublattices of the lattice of local clones
• The complexity of equality constraint languages
• All countable monoids embed into the monoid of the infinite random graph
• Oligomorphic clones
• A survey of clones on infinite sets
• Maximal infinite-valued constraint languages
• Ramsey classes of set systems
• The partite construction and Ramsey set systems
• Transitivity of permutation groups on unordered sets
• Partitions of finite relational and set systems
• The monoid of the random graph
• The endomorphism monoid of the random graph has uncountably many ideals.
• Reducts of random hypergraphs
• Schaefer's Theorem for Graphs
• Horn versus full first-order: Complexity dichotomies in algebraic constraint satisfaction
• The reducts of equality up to primitive positive interdefinability
• Reducts of Ramsey structures
• Constraint Satisfaction with Countable Homogeneous Templates
• A dichotomy theorem for constraint satisfaction problems on a 3-element set
• The 116 reducts of (ℚ, <, a)
• Reducts of the random graph
• Models Without Indiscernibles
• The complexity of satisfiability problems
• The random graph

This page was built for publication: Minimal functions on the random graph