Given a minor-closed class A of graphs, let βAdenote the supremum over all graphs in A of the ratio of edges to vertices. We investigate the set B of all such values βA, taking further the project begun by Eppstein. Amongst other results, we determine the small values in B (those up to 2); we show that B is ‘asymptotically dense’; and we answer some questions posed by Eppstein
The "extremal function" $c(H)$ of a graph $H$ is the supremum of densities of graphs not containing ...
Let Ex(n, k, µ) denote the maximum number of edges of an n-vertex graph in which every subgraph of k...
Abstract. A fundamental result in structural graph theory states that every graph with large average...
Given a minor-closed class A of graphs, let βAdenote the supremum over all graphs in A of the ratio ...
We define the limiting density of a minor-closed family of simple graphs F to be the smallest number...
We define the limiting density of a minor-closed family of simple graphs F to be the smallest number...
We define the limiting density of a minor-closed family of simple graphs F to be the smallest number...
AbstractA minor-closed class of graphs is a set of labelled graphs which is closed under isomorphism...
This paper addresses the following question for a given graph H: What is the minimum number f(H) suc...
Let H be a graph. If G is an n-vertex simple graph that does not contain H as a minor, what is the m...
AbstractLet H be a graph. If G is an n-vertex simple graph that does not contain H as a minor, what ...
Abstract. Let A be a minor-closed class of labelled graphs, and let Gn be a random graph sampled uni...
We prove that for every proper minor-closed class I of graphs there exists a constant c such that fo...
We prove an asymptotically tight bound on the extremal density guaranteeing subdivisions of bounded-...
A fundamental result of Mader from 1972 asserts that a graph of high average degree contains a highl...
The "extremal function" $c(H)$ of a graph $H$ is the supremum of densities of graphs not containing ...
Let Ex(n, k, µ) denote the maximum number of edges of an n-vertex graph in which every subgraph of k...
Abstract. A fundamental result in structural graph theory states that every graph with large average...
Given a minor-closed class A of graphs, let βAdenote the supremum over all graphs in A of the ratio ...
We define the limiting density of a minor-closed family of simple graphs F to be the smallest number...
We define the limiting density of a minor-closed family of simple graphs F to be the smallest number...
We define the limiting density of a minor-closed family of simple graphs F to be the smallest number...
AbstractA minor-closed class of graphs is a set of labelled graphs which is closed under isomorphism...
This paper addresses the following question for a given graph H: What is the minimum number f(H) suc...
Let H be a graph. If G is an n-vertex simple graph that does not contain H as a minor, what is the m...
AbstractLet H be a graph. If G is an n-vertex simple graph that does not contain H as a minor, what ...
Abstract. Let A be a minor-closed class of labelled graphs, and let Gn be a random graph sampled uni...
We prove that for every proper minor-closed class I of graphs there exists a constant c such that fo...
We prove an asymptotically tight bound on the extremal density guaranteeing subdivisions of bounded-...
A fundamental result of Mader from 1972 asserts that a graph of high average degree contains a highl...
The "extremal function" $c(H)$ of a graph $H$ is the supremum of densities of graphs not containing ...
Let Ex(n, k, µ) denote the maximum number of edges of an n-vertex graph in which every subgraph of k...
Abstract. A fundamental result in structural graph theory states that every graph with large average...