A combinatorial property and power graphs of semigroups
Commentationes Mathematicae Universitatis Carolinae, Tome 45 (2004) no. 1, pp. 1-7
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library
Research on combinatorial properties of sequences in groups and semigroups originates from Bernhard Neumann's theorem answering a question of Paul Erd"{o}s. For results on related combinatorial properties of sequences in semigroups we refer to the book [3]. In 2000 the authors introduced a new combinatorial property and described all groups satisfying it. The present paper extends this result to all semigroups.
Research on combinatorial properties of sequences in groups and semigroups originates from Bernhard Neumann's theorem answering a question of Paul Erd"{o}s. For results on related combinatorial properties of sequences in semigroups we refer to the book [3]. In 2000 the authors introduced a new combinatorial property and described all groups satisfying it. The present paper extends this result to all semigroups.
@article{CMUC_2004_45_1_a0,
author = {Kelarev, A. V. and Quinn, S. J.},
title = {A combinatorial property and power graphs of semigroups},
journal = {Commentationes Mathematicae Universitatis Carolinae},
pages = {1--7},
year = {2004},
volume = {45},
number = {1},
mrnumber = {2076856},
zbl = {1099.05042},
language = {en},
url = {http://geodesic.mathdoc.fr/item/CMUC_2004_45_1_a0/}
}
Kelarev, A. V.; Quinn, S. J. A combinatorial property and power graphs of semigroups. Commentationes Mathematicae Universitatis Carolinae, Tome 45 (2004) no. 1, pp. 1-7. http://geodesic.mathdoc.fr/item/CMUC_2004_45_1_a0/