An Application of Connectivity Theory in Graphs to Factorizations of Elements in Groups

European Journal of Combinatorics - Tập 2 - Trang 349-355 - 1981
Yahya Ould Hamidoune1
1Université Pierre et Marie Curie, UER 48, ER Combinatoire, 4 Place Jussieu, 75005 Paris, France

Tài liệu tham khảo

Berge, 1970 Bermond, 1975, 1-graphes réguliers de girth donné, Cahiers Centre Études Rech. Opér., 123 Dirac, 1964, Extensions of Menger theorem, J. London Math. Soc., 38, 148 Hamidoune, 1977, Sur les atomes d'un graphe orienté, C. R. Acad. Sci. Paris Sér. A, 284, 1253 Hamidoune, 1980, Connectivity of transitive digraphs and a combinatorial property of finite groups, Ann. Discrete Math., 8, 61, 10.1016/S0167-5060(08)70851-3 Y.O. Hamidoune: Quelques problèmes de connexité dans les graphes orientés, J. Combin. Theory Ser. B, to appear. Mader, 1970, Uber zusammen symmetricher Graphen, Arch. Math., 21, 331, 10.1007/BF01220924 Mader, 1971, Eine Eigenschaft der Atome endlicher Graphen, Arch. Math., 22, 333, 10.1007/BF01222585 Mader, 1973, Grad and lokalar zusammenhäng in endlichen Graphen, Math. Ann., 205, 9, 10.1007/BF01432512 Mann, 1967, Sums of sets in the elementary groups of type (p, p), J. Combin. Theory, 2, 275, 10.1016/S0021-9800(67)80028-0 Olson, 1969, A combinatorial problem in finite groups II, J. Number Theory, 15, 195, 10.1016/0022-314X(69)90037-7 Watkins, 1970, Connectivity of transitive graphs, J. Combin. Theory, 8, 23, 10.1016/S0021-9800(70)80005-9