On Iterated Image Size for Point-Symmetric Relations

DOI10.1017/S0963548307008620zbMath1154.05037arXiv0704.0459OpenAlexW2106914725MaRDI QIDQ5448990

Yahya Ould Hamidoune

Publication date: 10 March 2008

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

zbMATH Keywords

digraphconnectivityvertex-transitivevertex-symmetriciterated neighborhood

Mathematics Subject Classification ID

Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

On Seymour's second neighborhood conjecture of \(m\)-free digraphs ⋮ Openly disjoint circuits through a vertex in regular digraphs ⋮ Extensions of the Scherk-Kemperman theorem ⋮ 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

Cites Work

• Sur les atomes d'un graphe de Cayley infini. (On the atoms of an infinite Cayley graph)
• On small sumsets in an abelian group
• An application of connectivity theory in graphs to factorizations of elements in groups
• Quelques problèmes de connexite dans les graphes orientes
• Vosperian and superconnected abelian Cayley digraphs
• On the Addition of Elements of a Sequence

This page was built for publication: On Iterated Image Size for Point-Symmetric Relations