The number of graphs not containing \(K_{3,3}\) as a minor (Q1010848)
From MaRDI portal
!
WARNING
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 5541019
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The number of graphs not containing \(K_{3,3}\) as a minor |
scientific article; zbMATH DE number 5541019 |
Statements
The number of graphs not containing \(K_{3,3}\) as a minor (English)
0 references
7 April 2009
0 references
Summary: We derive precise asymptotic estimates for the number of labelled graphs not containing \(K_{3,3}\) as a minor, and also for those which are edge maximal. Additionally, we establish limit laws for parameters in random \(K_{3,3}\)-minor-free graphs, like the number of edges. To establish these results, we translate a decomposition for the corresponding graphs into equations for generating functions and use singularity analysis. We also find a precise estimate for the number of graphs not containing the graph \(K_{3,3}\) plus an edge as a minor.
0 references
symptotic estimates
0 references
number of labelled graphs
0 references
generating functions
0 references
0.7561591267585754
0 references
0.7509617209434509
0 references
0.7484461069107056
0 references
