Maximum degree in minor-closed classes of graphs
Omer Gimenez, Dieter Mitsche, Marc Noy
TL;DR
None
Contribution
None
Abstract
Given a class of graphs G closed under taking minors, we study the maximum degree \Delta_n of random graphs from G with n vertices. We prove several lower and upper bounds that hold with high probability. Among other results, we find classes of graphs providing orders of magnitude for \Delta_n not observed before, such us \log n/ \log \log \log n and \log n/ \log \log \log \log n.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Graph Theory Research · Graph theory and applications