The minimum number of 4-cliques in graphs with triangle-free complement
Abstract
Write f(n) for the minimum number of 4-cliques in graphs of order n with triangle-free complement. Finding f(n) is a particular case of a problem raised by Erdos in 1962. We give an upper bound of f(n) and a matching lower bound when the graph is close to regular.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.