No label defined (Q3344228)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3877223
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3877223 |
Statements
1984
0 references
color cyclic factorization
0 references
isomorphic factorizations
0 references
self-complementary graphs
0 references
enumeration
0 references
0.7855210900306702
0 references
0.7840145826339722
0 references
0.7792525291442871
0 references
0.7731674313545227
0 references
[For the entire collection see Zbl 0542.00002.] From the author's abstract: ''For an arbitrary graph G, a partition of its edges into k color classes labeled 0,1,...,k-1 is called a color cyclic factorization if G has an automorphism which cycles the colors, that is, each edge of color i is mapped to an edge of color \(i+1 mod k\). This is a more restrictive factorization than the ''isomorphic factorizations'' recently in vogue. For G complete and \(k=2\), this specializes to give self-complementary graphs. We apply Pólya's enumeration theory to derive a simple formula for the number of distinct color cyclic factorizations of G. Limiting G to the complete graphs, we find asymptotic formulas for the number of factorizations. A large open area remains to analyze factorizations whose colors are permuted by groups other than the cyclic group. We solve the problem when the color group is a direct product of cyclic groups whose orders are relatively prime in pairs.''
0 references