Set-homogeneous directed graphs

DOI10.1016/J.JCTB.2011.08.002MaRDI QIDQ412175zbMATHOpenAlexDBLPWikidataFDO

Authors Dugald Macpherson, Cheryl E. Praeger, Gordon Royle, R. Gray

Publication date 4 May 2012

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

digraphshomogeneous structuresset-homogeneous structures

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Abstract: A directed graph is set-homogeneous if, whenever U and V are isomorphic finite subdigraphs, there is an automorphism g of the digraph with U^g=V. Here, extending work of Lachlan on finite homogeneous digraphs, we classify finite set-homogeneous digraphs, where we allow some pairs of vertices to have arcs in both directions. Under the assumption that such pairs of vertices are not allowed, we obtain initial results on countably infinite set-homogeneous digraphs, classifying those which are not 2-homogeneous.

Recommendations

• Homogeneous 2-partite digraphs
• scientific article; zbMATH DE number 887760
• The classification of finite and locally finite connected-homogeneous digraphs
• Characterizing homogenous digraphs
• Set-homogeneous graphs

Cites work

• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 3819758 (Why is no real title available?)
• scientific article; zbMATH DE number 3730191 (Why is no real title available?)
• scientific article; zbMATH DE number 44603 (Why is no real title available?)
• scientific article; zbMATH DE number 2152953 (Why is no real title available?)
• scientific article; zbMATH DE number 3080680 (Why is no real title available?)
• A finite presentation of the rational Urysohn space
• Antipodal distance transitive covers of complete graphs
• Combinatorially homogeneous graphs
• Countable Homogeneous Tournaments
• Countable Ultrahomogeneous Undirected Graphs
• Countable homogeneous partially ordered sets
• Cycle types in infinite permutation groups
• Finite presentation of homogeneous graphs, posets and Ramsey classes
• Fraïssé limits, Ramsey theory, and topological dynamics of automorphism groups
• Homogeneous graphs
• Infinite homogeneous bipartite graphs with unequal sides
• Notes on infinite permutation groups
• On Homogeneous Graphs
• Permutation Groups with Multiply Transitive Suborbits
• SOME TREELIKE OBJECTS
• Set-homogeneous graphs
• Structure of partially ordered sets with transitive automorphism groups
• The Urysohn sphere is oscillation stable
• The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournaments
• Theory of relations. Transl. from the French by P. Clote
• Transitivity of finite permutation groups on unordered sets
• Transitivity of permutation groups on unordered sets

Cited in

(12)

• Orbit-equivalent infinite permutation groups.
• Characterizing homogenous digraphs
• scientific article; zbMATH DE number 91055 (Why is no real title available?)
• A survey of homogeneous structures
• Classification of some countable descendant-homogeneous digraphs
• scientific article; zbMATH DE number 887760 (Why is no real title available?)
• Homogeneous 2-partite digraphs
• Homogeneous structures -- a list of open problems
• The classification of finite and locally finite connected-homogeneous digraphs
• scientific article; zbMATH DE number 4010503 (Why is no real title available?)
• Locally-finite connected-homogeneous digraphs
• Set‐homogeneous hypergraphs

Describes a project that uses

Uses Software

• nauty

This page was built for publication: Set-homogeneous directed graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412175)