No label defined (Q3705481)

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

      Statements

      0 references
      0 references
      1984
      0 references
      C(2k\(+1)\)-free graphs
      0 references
      cycles
      0 references
      [For the entire collection see Zbl 0559.00001.] Let k be a positive integer. In this paper, we determine asymptotically the number of graphs on n vertices which contain as subgraphs no cycles of length \(2k+1\). All graphs considered are undirected and without loops and multiple edges. Let \(C_{2k+1}\) denote a cycle of length \(2k+1\). We say that graphs without any \(C_{2k+1}\) are \(C_{2k+1}\)-free. We show that the number of \(C_{2k+1}\)-free graphs on n vertices is asymptotically (as \(n\to \infty)\) equal to the number of bipartite graphs on n vertices.
      0 references

      Identifiers