论文信息 - Abelian 1-factorizations in infinite graphs - 字舞流文

Abelian 1-factorizations in infinite graphs

For each finitely generated abelian infinite group G, we construct a 1-factorization of the countable complete graph admitting G as an automorphism group acting sharply transitively on vertices.

Giuseppe Mazzuoccolo | Simona Bonvicini

[1] Gloria Rinaldi,et al. Quaternionic Starters , 2005, Graphs Comb..

[2] Anita Pasotti,et al. Symmetric 1-factorizations of the complete graph , 2010, Eur. J. Comb..

[3] Marco Buratti,et al. Abelian 1-Factorizations of the Complete Graph , 2001, Eur. J. Comb..

[4] Simona Bonvicini,et al. Frattini-based starters in 2-groups , 2008, Discret. Math..

[5] Domenico Labbate,et al. One‐factorizations of complete graphs with vertex‐regular automorphism groups , 2002 .

[6] László Fuchs,et al. Infinite Abelian groups , 1970 .

[7] Alexander Rosa,et al. One-factorizations of the complete graph - A survey , 1985, J. Graph Theory.

[8] Alan Hartman,et al. Cyclic One-Factorization of the Complete Graph , 1985, Eur. J. Comb..

[9] Gábor Korchmáros,et al. Sharply transitive 1‐factorizations of the complete graph with an invariant 1‐factor , 1994 .