Graphs that contain multiply transitive matchings

DOI10.1016/J.EJC.2020.103236zbMATH Open1458.05219arXiv1706.08964OpenAlexW3084010807MaRDI QIDQ2225440FDOQ2225440

Authors: Alex Schaefer, Eric Swartz 

Publication date: 8 February 2021

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Abstract: Let $Gamma$ be a finite, undirected, connected, simple graph. We say that a matching $mathcalM$ is a extit{permutable $m$-matching} if $mathcalM$ contains $m$ edges and the subgroup of $extAut(Gamma)$ that fixes the matching $mathcalM$ setwise allows the edges of $mathcalM$ to be permuted in any fashion. A matching $mathcalM$ is extit{2-transitive} if the setwise stabilizer of $mathcalM$ in $extAut(Gamma)$ can map any ordered pair of distinct edges of $mathcalM$ to any other ordered pair of distinct edges of $mathcalM$. We provide constructions of graphs with a permutable matching; we show that, if $Gamma$ is an arc-transitive graph that contains a permutable $m$-matching for $mge4$, then the degree of $Gamma$ is at least $m$; and, when $m$ is sufficiently large, we characterize the locally primitive, arc-transitive graphs of degree $m$ that contain a permutable $m$-matching. Finally, we classify the graphs that have a $2$-transitive perfect matching and also classify graphs that have a permutable perfect matching.

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

Recommendations

• Characterization of perfect matching transitive graphs
• Perfect matching transitivity of circulant graphs
• scientific article; zbMATH DE number 3861198
• Perfect matchings in edge-transitive graphs
• Representation of Permutation Groups by Coloured Graphs

zbMATH Keywords

\(G\)-permutable \(m\)-matching2-transitive matching

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Almost covers of 2-arc transitive graphs
• Topological graph theory.
• On the Symmetry of Cubic Graphs
• Title not available (Why is that?)
• Primitive rank 3 groups on symmetric designs
• Elementary abelian covers of graphs
• THOMPSON–WIELANDT-LIKE THEOREMS REVISITED
• Polygonal graphs
• Title not available (Why is that?)
• A family of near-polygonal graphs of valency 10
• Two-arc transitive near-polygonal graphs
• Title not available (Why is that?)
• A construction of an infinite family of 2-arc transitive polygonal graphs of arbitrary even girth
• A construction of an infinite family of 2-arc transitive polygonal graphs of arbitrary odd girth
• Classification of 2-transitive symmetric designs
• Affine rank 3 groups on symmetric designs
• Vertex-imprimitive symmetric graphs with exactly one edge between any two distinct blocks
• The dimension of the negative cycle vectors of a signed graph

Cited In (4)

• Characterization of perfect matching transitive graphs
• The dimension of the negative cycle vectors of a signed graph
• On the ordering of graphs with respect to their matching numbers
• Perfect matching transitivity of circulant graphs

This page was built for publication: Graphs that contain multiply transitive matchings

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