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

DOI10.1090/S0002-9947-2012-05666-2zbMATH Open1262.05071arXiv1004.5273MaRDI QIDQ4915344FDOQ4915344

Authors: Matthias Hamann, F. Hundertmark 

Publication date: 10 April 2013

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

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.

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)

Cites Work

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

Cited In (5)

• Title not available (Why is that?)
• Vertex cuts
• The classification of finite and locally finite connected-homogeneous digraphs
• Local 2-separators
• Connected-homomorphism-homogeneous graphs

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)