login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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

%I #18 Nov 03 2018 18:50:44

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

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

%H Robert Cowen, <a href="https://doi.org/10.3888/tmj.20-6">Improving the Kruskal-Katona Bounds for Complete Subgraphs of a Graph</a>, The Mathematica Journal (2018) Vol. 20.

%H Robert Cowen, <a href="https://arxiv.org/abs/1810.05704">Almost Complete Graphs and the Kruskal Katona Theorem</a>, arXiv:1810.05704 [math.CO], 2018.

%H Robert Cowen and Bill Emerson, <a href="https://www.researchgate.net/publication/287991696_On_Finding_k4k3_x">On finding k4(k3 <= x)</a>, New York Graph Theory Day, 34 (1997). Graph Theory Notes N. Y. 34 (1998), 26-30.

%K nonn,more

%O 0,4

%A _N. J. A. Sloane_