scientific article; zbMATH DE number 3655979

From MaRDI portal
Publication:3855211





[For the entire collection see Zbl 0384.00005.] The author proves the following two theorems: If a graph \(G_n\) does not contain a cycle \(C_{2k+1}\) for \(3\leq k\leq r\) then \(G_n\) contains at least \((1-\varepsilon)n^{1-1/r}\) independent vertices if \(n> n_{\varepsilon}\); and, there is a positive function f(c) such that if a graph \(G_n\) has at least \(cn^2\) edges, then it contains a refinement of a complete k-graph where \(k> f(c)n^{1/2}\). He also summarizes the progress made on a number of open extremal problems.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3855211)