Maximum degree in minor-closed classes of graphs
نویسندگان
چکیده
Given a class of graphs G closed under taking minors, we study the maximum degree ∆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 ∆n not observed before, such us log n/ log log log n and log n/ log log log log n. © 2016 Elsevier Ltd. All rights reserved.
منابع مشابه
Thin graph classes and polynomial-time approximation schemes
Baker [1] devised a powerful technique to obtain approximation schemes for various problems restricted to planar graphs. Her technique can be directly extended to various other graph classes, among the most general ones the graphs avoiding a fixed apex graph as a minor. Further generalizations (e.g., to all proper minor closed graph classes) are known, but they use a combination of techniques a...
متن کاملRandom planar graphs and beyond
We survey several results on the enumeration of planar graphs and on properties of random planar graphs. This includes basic parameters, such as the number of edges and the number of connected components, and extremal parameters such as the size of the largest component, the diameter and the maximum degree. We discuss extensions to graphs on surfaces and to classes of graphs closed under minors...
متن کاملSquares of Low Maximum Degree
A graph H is a square root of a graph G if G can be obtained from H by adding an edge between any two vertices in H that are of distance 2. The Square Root problem is that of deciding whether a given graph admits a square root. This problem is only known to be NP-complete for chordal graphs and polynomial-time solvable for non-trivial minor-closed graph classes and a very limited number of othe...
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملCharacterisations and examples of graph classes with bounded expansion
Classes with bounded expansion, which generalise classes that exclude a topological minor, have recently been introduced by Nešetřil and Ossona de Mendez. These classes are defined by the fact that the maximum average degree of a shallow minor of a graph in the class is bounded by a function of the depth of the shallow minor. Several linear-time algorithms are known for bounded expansion classe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Eur. J. Comb.
دوره 55 شماره
صفحات -
تاریخ انتشار 2016