Reducts of the generic digraph

DOI10.1016/j.apal.2015.12.006zbMath1329.05305arXiv1411.4820OpenAlexW2963424778WikidataQ57948741 ScholiaQ57948741MaRDI QIDQ904153

Lovkush Agarwal

Publication date: 12 January 2016

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

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

zbMATH Keywords

digraphpermutation grouphomogeneous structurecanonical functionreductclosed group

Mathematics Subject Classification ID

Maximal subgroups (20E28) Directed graphs (digraphs), tournaments (05C20) Interpolation, preservation, definability (03C40) Infinite automorphism groups (20B27) Group actions on combinatorial structures (05E18)

Related Items (5)

PAIRWISE NONISOMORPHIC MAXIMAL-CLOSED SUBGROUPS OF SYM(ℕ) VIA THE CLASSIFICATION OF THE REDUCTS OF THE HENSON DIGRAPHS ⋮ Permutation monoids and MB-homogeneity for graphs and relational structures ⋮ Two Fraïssé-style theorems for homomorphism-homogeneous relational structures ⋮ Permutation groups with small orbit growth ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Reducts of the random partial order
• Transitivity of permutation groups on unordered sets
• Partitions of finite relational and set systems
• Reducts of random hypergraphs
• The 42 reducts of the random ordered graph
• Reducts of Ramsey structures
• The 116 reducts of (ℚ, <, a)
• Reducts of the random graph
• Decidability of Definability

This page was built for publication: Reducts of the generic digraph