DOIAbstract
AbstractLet c(t) be the minimum number c such that every graph G with e(G)⩾c|G| contracts to a complete graph Kt. We show thatc(t)=(α+o(1))tlogtwhere α=0.319... is an explicit constant. Random graphs are extremal graphs
AbstractLet c(t) be the minimum number c such that every graph G with e(G)⩾c|G| contracts to a complete graph Kt. We show thatc(t)=(α+o(1))tlogtwhere α=0.319... is an explicit constant. Random graphs are extremal graphs
This dissertation investigates several questions in extremal graph theory and the theory of graph m...
Abstract. Let ccl(G) denote the order of the largest complete minor in a graph G (also called the co...
The graph G contains a graph H as a minor if there exist pairwise disjoint sets {S-i subset of V(G)v...
AbstractLet c(t) be the minimum number c such that every graph G with e(G)⩾c|G| contracts to a compl...
We investigate the maximum number of edges that a graph G can have if it does not contain a given gr...
AbstractLet D(H) be the minimum d such that every graph G with average degree d has an H-minor. Myer...
Abstract. We show that there is a constant c so that for fixed r ≥ 3 a.a.s. an r-regular graph on n ...
Abstract. We show that there is a constant c so that for fixed r ≥ 3 a.a.s. an r-regular graph on n ...
AbstractA graph H is a minor of a graph G if H can be obtained from a subgraph of G by contracting e...
We prove that every graph with n vertices and at least 5n − 8 edges contains the Petersen graph as a...
The "extremal function" $c(H)$ of a graph $H$ is the supremum of densities of graphs not containing ...
AbstractFor 0 < γ ≤ 1 and graphs G and H, we write G[formula]H if any γ-proportion of the edges of G...
AbstractFor 0 < γ ≤ 1 and graphs G and H, we write G[formula]H if any γ-proportion of the edges of G...
AbstractWe consider the question of what average degree forces a graph to have a Ks,t minor, for s f...
AbstractGiven integers r and s, and n large compared to r and s, we determine the maximum size of a ...
This dissertation investigates several questions in extremal graph theory and the theory of graph m...
Abstract. Let ccl(G) denote the order of the largest complete minor in a graph G (also called the co...
The graph G contains a graph H as a minor if there exist pairwise disjoint sets {S-i subset of V(G)v...
AbstractLet c(t) be the minimum number c such that every graph G with e(G)⩾c|G| contracts to a compl...
We investigate the maximum number of edges that a graph G can have if it does not contain a given gr...
AbstractLet D(H) be the minimum d such that every graph G with average degree d has an H-minor. Myer...
Abstract. We show that there is a constant c so that for fixed r ≥ 3 a.a.s. an r-regular graph on n ...
Abstract. We show that there is a constant c so that for fixed r ≥ 3 a.a.s. an r-regular graph on n ...
AbstractA graph H is a minor of a graph G if H can be obtained from a subgraph of G by contracting e...
We prove that every graph with n vertices and at least 5n − 8 edges contains the Petersen graph as a...
The "extremal function" $c(H)$ of a graph $H$ is the supremum of densities of graphs not containing ...
AbstractFor 0 < γ ≤ 1 and graphs G and H, we write G[formula]H if any γ-proportion of the edges of G...
AbstractFor 0 < γ ≤ 1 and graphs G and H, we write G[formula]H if any γ-proportion of the edges of G...
AbstractWe consider the question of what average degree forces a graph to have a Ks,t minor, for s f...
AbstractGiven integers r and s, and n large compared to r and s, we determine the maximum size of a ...
This dissertation investigates several questions in extremal graph theory and the theory of graph m...
Abstract. Let ccl(G) denote the order of the largest complete minor in a graph G (also called the co...
The graph G contains a graph H as a minor if there exist pairwise disjoint sets {S-i subset of V(G)v...
Add to ORKG