|
|
A020917
|
|
Maximum number of K4's (complete 4 graphs) a graph can contain if it contains at most n distinct K3's (triangles).
|
|
0
|
|
|
1, 1, 1, 2, 2, 2, 5, 5, 5, 6, 6, 6, 9, 9, 9, 10, 15
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,4
|
|
LINKS
|
Robert Cowen and Bill Emerson, On finding k4(k3 <= x), New York Graph Theory Day, 34 (1997). Graph Theory Notes N. Y. 34 (1998), 26-30.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|