Maximum degree in minor-closed classes of graphs

DOI10.1016/j.ejc.2016.02.001zbMath1333.05079arXiv1304.5049OpenAlexW1709401997MaRDI QIDQ268260

Marc Noy, Omer Giménez, Dieter Mitsche

Publication date: 14 April 2016

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

maximum degree of random graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Vertex degrees (05C07)

Related Items

Exact-Size Sampling of Enriched Trees in Linear Time ⋮ Random graphs from a block-stable class ⋮ The maximal degree in a Poisson-Delaunay graph

Cites Work

• Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation
• Degree distribution in random planar graphs
• The distribution of the maximum vertex degree in random planar maps
• On the maximum degree in a random tree
• Graph classes with given 3-connected components: Asymptotic enumeration and random graphs
• The maximum degree of random planar graphs
• Random Graphs with Few Disjoint Cycles
• On the Maximum Degree of a Random Planar Graph
• The Degree Sequence of Random Graphs from Subcritical Classes
• Random Graphs from a Minor-Closed Class
• The maximum degree in a random tree and related problems
• Extremal Parameters in Sub-Critical Graph Classes
• The Maximum Degree of Series-Parallel Graphs