Construction of some countable 1-arc-transitive bipartite graphs

DOI10.1016/j.disc.2007.12.019zbMath1198.05090MaRDI QIDQ998381

John K. Truss, Robert D. Gray

Publication date: 28 January 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.12.019

zbMATH Keywords

partially ordered sets; infinite graphs; arc-transitive graphs; cycle-free partial orders

Mathematics Subject Classification ID

06A07: Combinatorics of partially ordered sets

05C25: Graphs and abstract algebra (groups, rings, fields, etc.)

05C63: Infinite graphs

Related Items

Uncountable cofinalities of automorphism groups of linear and partial orders, Construction of some uncountable 2-arc-transitive bipartite graphs, Countable locally 2-arc-transitive bipartite graphs, Cycle-free partial orders and ends of graphs

Cites Work

• Unnamed Item
• Construction of some uncountable 2-arc-transitive bipartite graphs
• On \(k\)-CS-transitive cycle-free partial orders with finite alternating chains
• Structure of partially ordered sets with transitive automorphism groups
• Automorphism Groups of Infinite Semilinear Orders (I)
• The structure of k-CS-transitive cycle-free partial orders with infinite chains
• Simple automorphism groups of cycle-free partial orders
• The Reconstruction of Trees from Their Automorphism Groups
• The structure of 𝑘-CS-transitive cycle-free partial orders
• Relations related to betweenness: their structure and automorphisms
• Very Homogeneous Generalized n -Gons of Finite Morley Rank
• Countable 1-transitive coloured linear orderings II
• Betweenness relations and cycle-free partial orders
• Elementary properties of cycle-free partial orders and their automorphism groups