login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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

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 A035643 A324925

Adjacent sequences:  A020914 A020915 A020916 * A020918 A020919 A020920

KEYWORD

nonn,more

AUTHOR

N. J. A. Sloane

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 14 03:58 EDT 2019. Contains 327995 sequences. (Running on oeis4.)