Set-homogeneous directed graphs

DOI10.1016/J.JCTB.2011.08.002zbMATH Open1239.05082DBLPjournals/jct/GrayMPR12arXiv1011.4216OpenAlexW1970661141WikidataQ56987615 ScholiaQ56987615MaRDI QIDQ412175FDOQ412175

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

Publication date: 4 May 2012

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

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.

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)

Cites Work

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

Cited In (5)

• A survey of homogeneous structures
• Title not available (Why is that?)
• Orbit-equivalent infinite permutation groups.
• Title not available (Why is that?)
• Set‐homogeneous hypergraphs

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)