|
| |
|
|
A370741
|
|
Number of 3-edge-colorings of the complete graph on n labeled vertices without rainbow colored triangles.
|
|
1
|
|
|
|
1, 1, 3, 21, 279, 6129, 210987, 11813949, 1212514191, 258945624441, 119434656926403, 115822196942035936, 230278743809297350656, 927472598521910778658816, 7524503812375420895515115520, 122594420168978189387577050529792, 4004323623554618525117142486495526912
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,3
|
|
|
COMMENTS
|
A rainbow colored triangle is a triangle (3-clique) in which each of the edges has a different color.
The initial terms were calculated using a computer algorithm derived from a recursive formula based on the characteristics of 3-edge-colored cliques without rainbow colored triangles.
|
|
|
LINKS
|
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn,new
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
