An application of connectivity theory in graphs to factorizations of elements in groups

DOI10.1016/S0195-6698(81)80042-XzbMath0473.05032OpenAlexW2078598049WikidataQ114121537 ScholiaQ114121537MaRDI QIDQ1158436

Yahya Ould Hamidoune

Publication date: 1981

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

Full work available at URL: https://doi.org/10.1016/s0195-6698(81)80042-x

zbMATH Keywords

Cayley graphdiametergirthvertex-transitive

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Connectivity (05C40) Permutation groups (20B99)

Related Items (21)

Even cycles in directed graphs ⋮ Minimum order of loop networks of given degree and girth ⋮ A note on minimal directed graphs with given girth ⋮ The exponent of the primitive Cayley digraphs on finite abelian groups ⋮ Maximum diameter of regular digraphs ⋮ On the structure of subsets of an orderable group with some small doubling properties ⋮ On the superconnectivity and the conditional diameter of graphs and digraphs ⋮ Existence of openly disjoint circuits through a vertex ⋮ On a subgroup contained in some words with a bounded length ⋮ Some additive applications of the isoperimetric approach ⋮ Openly disjoint circuits through a vertex in regular digraphs ⋮ BOUNDED GENERATION AND LINEAR GROUPS ⋮ Small doubling in $m$-Engel groups ⋮ Extensions of the Scherk-Kemperman theorem ⋮ Groups with numerical restrictions on minimal generating sets ⋮ On Iterated Image Size for Point-Symmetric Relations ⋮ Yahya Ould Hamidoune's mathematical journey: a critical review of his work ⋮ On the second neighborhood conjecture of Seymour for regular digraphs with almost optimal connectivity ⋮ Factorisations courtes dans un groupe fini. (Short factorizations in a finite group) ⋮ A note on the girth of digraphs ⋮ Degree and local connectivity in digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A combinatorial problem on finite Abelian groups. II
• Über den Zusammenhang symmetrischer Graphen
• Grad und lokaler Zusammenhang in endlichen Graphen
• Connectivity of Transitive Digraphs and a Combinatorial Property of Finite Groups
• Sums of sets in the elementary abelian group of type (p, p)
• Connectivity of transitive graphs
• Extensions of Menger's Theorem^†
• Eine Eigenschaft der Atome endlicher Graphen

This page was built for publication: An application of connectivity theory in graphs to factorizations of elements in groups