Maximum number of K4's (complete 4 graphs) a graph can contain if it contains at most n distinct K3's (triangles).
A020917
Maximum number of K4's (complete 4 graphs) a graph can contain if it contains at most n distinct K3's (triangles).
Terms
- a(0) =0a(1) =0a(2) =0a(3) =0a(4) =1a(5) =1a(6) =1a(7) =2a(8) =2a(9) =2a(10) =5a(11) =5a(12) =5a(13) =6a(14) =6a(15) =6a(16) =9a(17) =9a(18) =9a(19) =10a(20) =15
External references
- oeis: A020917