The number of graphs not containing K3,3 as a minor

Gerke, Stefanie, Giménez, Omer, Noy, Marc and Weissl, Andreas

(2008)

Gerke, Stefanie, Giménez, Omer, Noy, Marc and Weissl, Andreas (2008) The number of graphs not containing K3,3 as a minor. The Electronic Journal of Combinatorics, 15

Our Full Text Deposits

Full text access: Open

Full text file - 168.84 KB

Links to Copies of this Item Held Elsewhere


Abstract

We derive precise asymptotic estimates for the number of labelled graphs not containing K-3,K-3 as a minor, and also for those which are edge maximal. Additionally, we establish limit laws for parameters in random K-3,K-3-minor-freegraphs, 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,K-3 plus an edge as a minor.

Information about this Version

This is a Approved version
This version's date is: 8/9/2008
This item is not peer reviewed

Link to this Version

https://repository.royalholloway.ac.uk/items/ad906614-df4d-7be1-6fe6-46db88e6ddac/4/

Item TypeJournal Article
TitleThe number of graphs not containing K3,3 as a minor
AuthorsGerke, Stefanie
Giménez, Omer
Noy, Marc
Weissl, Andreas
DepartmentsFaculty of Science\Mathematics

Identifiers

Deposited by Research Information System (atira) on 25-Feb-2014 in Royal Holloway Research Online.Last modified on 25-Feb-2014


Details