No label defined (Q3855211)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3655979
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3655979

      Statements

      1978
      0 references
      Problems
      0 references
      cycle
      0 references
      independent vertices
      0 references
      refinement
      0 references
      0 references
      [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.
      0 references

      Identifiers