No label defined (Q3680852)

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 3902677
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3902677

      Statements

      0 references
      0 references
      1984
      0 references
      planar graphs
      0 references
      triangulations
      0 references
      [For the entire collection see Zbl 0549.00001.] If H is a (planar) graph define f(n,H) to be the maximum, over all n- vertex planar graphs G, of the number of subgraphs of G isomorphic to H. The value of f(n,H) is determined precisely if H is either a complete bipartite (planar) graph or a triangulation without triangles which are not faces, and is bounded for all other triangulations H.
      0 references

      Identifiers