The number of graphs not containing \(K_{3,3}\) as a minor (Q1010848): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 0803.4418 / rank | |||
Normal rank |
Latest revision as of 19:34, 18 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The number of graphs not containing \(K_{3,3}\) as a minor |
scientific article |
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