The number of graphs not containing \(K_{3,3}\) as a minor

zbMath1163.05319arXiv0803.4418MaRDI QIDQ1010848

Stefanie Gerke, Marc Noy, Andreas Weißl, Omer Giménez

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0803.4418

zbMATH Keywords

generating functionsnumber of labelled graphssymptotic estimates

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Asymptotic enumeration (05A16)

Related Items (4)

Random graphs from a weighted minor-closed class ⋮ Enumeration of labelled 4-regular planar graphs. II: Asymptotics ⋮ Growth constants of minor-closed classes of graphs ⋮ On the probability of planarity of a random graph near the critical point

This page was built for publication: The number of graphs not containing \(K_{3,3}\) as a minor