Transitivity conditions in infinite graphs

DOI10.1007/S00493-012-2694-ZMaRDI QIDQ2250834zbMATH OpenOpenAlexFDO

Authors Matthias Hamann, Julian Pott

Publication date 21 July 2014

Published in Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

distance transitive graph\(k\)-distance transitive graphinfinite graph of connectivity 1

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Distance in graphs (05C12) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Infinite graphs (05C63)

Abstract: We study transitivity properties of graphs with more than one end. We completely classify the distance-transitive such graphs and, for all $kgeq3$, the $k$-CS-transitive such graphs.

Recommendations

• Distance-transitivity in infinite graphs
• scientific article; zbMATH DE number 2149411
• \(k\)-CS-transitive infinite graphs
• A note on infinite transitive graphs
• On vertex transitive graphs of infinite degree

Cites work

• scientific article; zbMATH DE number 3878961 (Why is no real title available?)
• scientific article; zbMATH DE number 41228 (Why is no real title available?)
• scientific article; zbMATH DE number 923850 (Why is no real title available?)
• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• Accessibility and ends of graphs
• Combinatorially homogeneous graphs
• Countable connected-homogeneous graphs
• Distance-transitivity in infinite graphs
• End compactifications in non-locally-finite graphs
• Homogeneous graphs
• Infinite distance transitive graphs of finite valency
• Metric ends, fibers and automorphisms of graphs
• On Homogeneous Graphs
• Vertex cuts
• Vertex-transitive graphs and accessibility
• \(k\)-CS-transitive infinite graphs

Cited in

(8)

• Translations and semi-translations in infinite graphs
• Group actions on metric spaces: fixed points and free subgroups
• Vertex cuts
• \(k\)-CS-transitive infinite graphs
• The classification of finite and locally finite connected-homogeneous digraphs
• The classification of connected-homogeneous digraphs with more than one end
• Infinite Vertex-Transitive, Edge-Transitive Non-1-Transitive Graphs
• Sharply \(k\)-arc-transitive-digraphs: finite and infinite examples

This page was built for publication: Transitivity conditions in infinite graphs

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