k-CS-transitive infinite graphs

DOI10.1016/J.JCTB.2008.07.008MaRDI QIDQ1003840zbMATH OpenOpenAlexFDO

Authors R. Gray

Publication date 4 March 2009

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

Full work available at URL https://doi.org/10.1016/j.jctb.2008.07.008

zbMATH Keywords

arc-transitive graphsautomorphism groupdistance-transitive graphsends of graphsgraphhomogeneous structuressymmetry

Mathematics Subject Classification ID

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

Recommendations

• Transitivity conditions in infinite graphs
• Finite 3-set-homogeneous graphs
• \(>k\)-homogeneous infinite graphs
• On k-connected-homogeneous graphs
• Finite 3-connected-set-homogeneous locally \(2\mathbf{K}_n\) graphs and \(s\)-arc-transitive graphs

Cites work

• 2-arc-transitive regular covers of complete graphs having the covering transformation group \(Z^{3}_{p}\)
• A census of infinite distance-transitive graphs
• Accessibility and Groups of Cohomological Dimension One
• Betweenness relations and cycle-free partial orders
• Combinatorially homogeneous graphs
• Countable connected-homogeneous graphs
• Countable Ultrahomogeneous Undirected Graphs
• Cutting up graphs
• Cycle-free partial orders and ends of graphs
• Descendants in highly arc transitive digraphs
• Distance-transitivity in infinite graphs
• Ends of graphs
• Finite symmetric graphs with two-arc transitive quotients
• Highly arc transitive digraphs
• Homogeneity conditions in graphs
• Homogeneous graphs
• 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?)
• Inaccessible groups and protrees
• Infinite distance transitive graphs of finite valency
• Infinite highly arc transitive digraphs and universal covering digraphs
• On Homogeneous Graphs
• Set-homogeneous graphs
• The Affine Permutation Groups of Rank Three
• The nonexistence of 8-transitive graphs
• The structure of k-CS-transitive cycle-free partial orders with infinite chains
• The structure of 𝑘-CS-transitive cycle-free partial orders
• Theory of relations. Transl. from the French by P. Clote
• Vertex-transitive graphs and accessibility

Cited in

(8)

• \(>k\)-homogeneous infinite graphs
• Finite 3-set-homogeneous graphs
• Transitivity conditions in infinite graphs
• Locally-finite connected-homogeneous digraphs
• On k-connected-homogeneous graphs
• Finite 3-connected-set-homogeneous locally \(2\mathbf{K}_n\) graphs and \(s\)-arc-transitive graphs
• Locally finite, planar, edge-transitive graphs
• Set‐homogeneous hypergraphs

This page was built for publication: \(k\)-CS-transitive infinite graphs

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