DOIAbstract
AbstractA conjecture of Sauer and Spencer states that any graph G on n vertices with minimum degree at least 2/3n contains any graph H on n vertices with maximum degree 2 or less. This conjecture is proven here for all sufficiently large n
AbstractA conjecture of Sauer and Spencer states that any graph G on n vertices with minimum degree at least 2/3n contains any graph H on n vertices with maximum degree 2 or less. This conjecture is proven here for all sufficiently large n
Abstract. Let G be a simple graph of order n, and let ∆(G) and ′(G) denote the maximum degree and ch...
We show that a digraph which contains a directed 2-factor and has minimum in-degree and outdegree at...
AbstractDobson (1994) conjectured that if G is a graph with girth no less than 2t + 1 and minimum de...
AbstractA conjecture of Sauer and Spencer states that any graph G on n vertices with minimum degree ...
AbstractIt is proved that a graph with n vertices and minimum degree at least [(h + 2)/2h]n contains...
A well known generalisation of Dirac's theorem states that if a graph G on n≥4k vertices has minimum...
AbstractAn n-ladder is a balanced bipartite graph with vertex sets A={a,…,an} and B={b1,…,bn} such t...
AbstractThe object of this paper is to review the general problem of using degree conditions to dete...
The conjecture of Bollobás and Komlós, recently proved by Böttcher, Schacht, and Taraz [Math. Ann., ...
In this paper we study the fundamental problem of finding small dense subgraphs in a given graph. Fo...
Let k be an integer such that k≥3, and let G be a 2-connected graph of order n with n≥4k+1, kn even,...
Suppose G is a simple graph with average vertex degree greater than k - 2. Erdös and Sós conjectured...
AbstractIn this paper we study the minimum degree condition for a Hamiltonian graph to have a 2-fact...
An H-n-factor of a graph G is defined to be a spanning sub-graph F of G such that each vertex has a ...
Much of extremal graph theory has concentrated either on finding very small subgraphs of a large gra...
Abstract. Let G be a simple graph of order n, and let ∆(G) and ′(G) denote the maximum degree and ch...
We show that a digraph which contains a directed 2-factor and has minimum in-degree and outdegree at...
AbstractDobson (1994) conjectured that if G is a graph with girth no less than 2t + 1 and minimum de...
AbstractA conjecture of Sauer and Spencer states that any graph G on n vertices with minimum degree ...
AbstractIt is proved that a graph with n vertices and minimum degree at least [(h + 2)/2h]n contains...
A well known generalisation of Dirac's theorem states that if a graph G on n≥4k vertices has minimum...
AbstractAn n-ladder is a balanced bipartite graph with vertex sets A={a,…,an} and B={b1,…,bn} such t...
AbstractThe object of this paper is to review the general problem of using degree conditions to dete...
The conjecture of Bollobás and Komlós, recently proved by Böttcher, Schacht, and Taraz [Math. Ann., ...
In this paper we study the fundamental problem of finding small dense subgraphs in a given graph. Fo...
Let k be an integer such that k≥3, and let G be a 2-connected graph of order n with n≥4k+1, kn even,...
Suppose G is a simple graph with average vertex degree greater than k - 2. Erdös and Sós conjectured...
AbstractIn this paper we study the minimum degree condition for a Hamiltonian graph to have a 2-fact...
An H-n-factor of a graph G is defined to be a spanning sub-graph F of G such that each vertex has a ...
Much of extremal graph theory has concentrated either on finding very small subgraphs of a large gra...
Abstract. Let G be a simple graph of order n, and let ∆(G) and ′(G) denote the maximum degree and ch...
We show that a digraph which contains a directed 2-factor and has minimum in-degree and outdegree at...
AbstractDobson (1994) conjectured that if G is a graph with girth no less than 2t + 1 and minimum de...
Add to ORKG