The classification of connected-homogeneous digraphs with more than one end

DOI10.1090/S0002-9947-2012-05666-2MaRDI QIDQ4915344zbMATH OpenFDO

Authors Matthias Hamann, F. Hundertmark

Publication date 10 April 2013

Published in Transactions of the American Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

highly-arc-transitive graphs: C-homogeneous digraphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Infinite graphs (05C63) Structural characterization of families of graphs (05C75)

Abstract: We classify the connected-homogeneous digraphs with more than one end. We further show that if their underlying undirected graph is not connected-homogeneous, they are highly-arc-transitive.

Cites work

• scientific article; zbMATH DE number 3819758 (Why is no real title available?)
• scientific article; zbMATH DE number 41228 (Why is no real title available?)
• scientific article; zbMATH DE number 3482343 (Why is no real title available?)
• scientific article; zbMATH DE number 923850 (Why is no real title available?)
• Accessibility and ends of graphs
• Combinatorially homogeneous graphs
• Countable Homogeneous Tournaments
• Countable Ultrahomogeneous Undirected Graphs
• Countable connected-homogeneous graphs
• Cutting up graphs
• Cutting up graphs revisited -- a short proof of Stallings' structure theorem.
• Distance-transitivity in infinite graphs
• End-transitive graphs
• Graph theory
• Highly arc transitive digraphs: reachability, topological groups
• Highly arc-transitive digraphs with no homomorphism onto \(\mathbb Z\)
• Homogeneity conditions in graphs
• Homogeneous graphs
• Homogeneous tournaments revisited
• Infinite distance transitive graphs of finite valency
• Infinite highly arc transitive digraphs and universal covering digraphs
• Infinite homogeneous bipartite graphs with unequal sides
• Locally finite homogeneous graphs
• Locally-finite connected-homogeneous digraphs
• On Homogeneous Graphs
• On vertex transitive graphs of infinite degree
• The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournaments
• Transitive digraphs with more than one end
• Transitivity conditions in infinite graphs
• Vertex-transitive graphs and accessibility

Cited in

(5)

• Connected-homomorphism-homogeneous graphs
• scientific article; zbMATH DE number 5308096 (Why is no real title available?)
• Vertex cuts
• The classification of finite and locally finite connected-homogeneous digraphs
• Local 2-separators

This page was built for publication: The classification of connected-homogeneous digraphs with more than one end

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