A020917 Maximum number of K4's (complete 4 graphs) a graph can contain if it contains at most n distinct K3's (triangles).

1, 1, 1, 2, 2, 2, 5, 5, 5, 6, 6, 6, 9, 9, 9, 10, 15

Offset

0,4

Links

Table of n, a(n) for n=0..16.

Robert Cowen, Improving the Kruskal-Katona Bounds for Complete Subgraphs of a Graph, The Mathematica Journal (2018) Vol. 20.

Robert Cowen, Almost Complete Graphs and the Kruskal Katona Theorem, arXiv:1810.05704 [math.CO], 2018.

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

Sequence in context: A081290 A168256 A123081 * A308772 A332966 A035643

Adjacent sequences: A020914 A020915 A020916 * A020918 A020919 A020920

Keyword

nonn,more

Author

N. J. A. Sloane

Status

approved