The Erds-Jacobson-Lehel conjecture on potentially P_k-graphic sequence is true
Jiong-Sheng Li · 1998
A variation in the classical Turn extremal problem is studied. A simple graph G of order n is said to have property P k if it contains a clique of size k+1 as its subgraph. An n term nonincreasing nonnegative integer sequence π=(d 1,d 2,...,d n) is said to be graphic if it is the degree sequence of a simple graph G of order n and such a graph G is referred to as a realization of π . A graphic sequence π is said to be potentially P k graphic if it has a realization G having property P k . The problem: determine the smallest positive even number σ(k,n) such that every n term graphic sequence π=(d 1,d 2,...,d n) without zero terms and with degree sum σ(π)=d 1+d 2+...+d n at least σ(k,n) is potentially P k graphic has been proved positive.$$$$