Core-free, rank two coset geometries from edge-transitive bipartite graphs

DOI10.2478/S12175-014-0253-3zbMATH Open1349.51001arXiv1106.5704OpenAlexW1964937565MaRDI QIDQ2931323FDOQ2931323

Authors: Julie De Saedeleer, Dimitri Leemans, Mark Mixer 

Publication date: 25 November 2014

Published in: Mathematica Slovaca (Search for Journal in Brave)

Abstract: It is known that the Levi graph of any rank two coset geometry is an edge-transitive graph, and thus coset geometries can be used to construct many edge transitive graphs. In this paper, we consider the reverse direction. Starting from edge- transitive graphs, we construct all associated core-free, rank two coset geometries. In particular, we focus on 3-valent and 4-valent graphs, and are able to construct coset geometries arising from these graphs. We summarize many properties of these coset geometries in a sequence of tables; in the 4-valent case we restrict to graphs that have relatively small vertex-stabilizers.

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

Recommendations

• A note on coset graphs
• scientific article; zbMATH DE number 554166
• Basic coset geometries
• Tetravalent edge-transitive Cayley graphs of Frobenius groups
• Edge-transitive graphs and combinatorial designs

zbMATH Keywords

bipartite graphincidence geometrycoset geometrycore-free geometry

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graph representations (geometric and intersection representations, etc.) (05C62) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Homomorphism, automorphism and dualities in linear incidence geometry (51A10) Other finite incidence structures (geometric aspects) (51E30)

Cited In (4)

• Flag-transitive block designs with automorphism group \(S_n w r S_2\)
• Constructing flag-transitive incidence structures
• Locally arc-transitive graphs of valence \(\{3,4\}\) with trivial edge kernel
• On a rank five geometry of Meixner for the Mathieu group \(M_{12}\)

This page was built for publication: Core-free, rank two coset geometries from edge-transitive bipartite graphs

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