Cliques in Graphs With Bounded Minimum Degree

ALLAN LO

Source record

Source: Crossref

Published: Jan 26, 2012

DOI: 10.1017/s0963548311000745

Open original source ↗

Source abstract

Let k r ( n , δ) be the minimum number of r -cliques in graphs with n vertices and minimum degree at least δ. We evaluate k r ( n , δ) for δ ≤ 4 n /5 and some other cases. Moreover, we give a construction which we conjecture to give all extremal graphs (subject to certain conditions on n , δ and r ).

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.