AbstractForests on n vertices with maximum number of maximal matchings are called extremal forests. All extremal forests, except 2K1, are trees. Extremal trees with small number n of vertices, n⩽19, are characterized; in particular, they are unique if n≠6. The exponential upper and lower bounds on the maximum number of maximal matchings among n-vertex trees have been found
We provide combinatorial decompositions as well as asymptotic tight estimates for two maximal parame...
AbstractA maximum stable set in a graph G is a stable set of maximum size. S is a local maximum stab...
AbstractFor a graph G, consider the pairs of edge-disjoint matchings whose union consists of as many...
AbstractForests on n vertices with maximum number of maximal matchings are called extremal forests. ...
AbstractWe determine upper and lower bounds for the number of maximum matchings (i.e., matchings of ...
We characterize the extremal trees that maximize the number of almost-perfect matchings, which are m...
AbstractLet H = F(v) ⊕ G(w) denote the graph obtained from F and G by identifying vertices v of F an...
Very recently, Alon and Frankl initiated the study of the maximum number of edges in $n$-vertex $F$-...
[3] have recently determined the maximum number of edges of a chordal graph with a maximum degree le...
This dissertation answers several questions in extremal graph theory, each concerning the maximum or...
AbstractA subset S of vertices of a graph G is independent if no two vertices in S are adjacent. In ...
AbstractThe ratio of the number of edges in a smallest maximal matching to the number of vertices in...
Blair et. al. [3] have recently determined the maximum number of edges of a chordal graph with a max...
AbstractLet m(G,k) be the number of k-matchings in the graph G. We write G1 ⪯ G2 if m(G1, k) ≤ m(G2,...
This dissertation answers several questions in extremal graph theory, each concerning the maximum or...
We provide combinatorial decompositions as well as asymptotic tight estimates for two maximal parame...
AbstractA maximum stable set in a graph G is a stable set of maximum size. S is a local maximum stab...
AbstractFor a graph G, consider the pairs of edge-disjoint matchings whose union consists of as many...
AbstractForests on n vertices with maximum number of maximal matchings are called extremal forests. ...
AbstractWe determine upper and lower bounds for the number of maximum matchings (i.e., matchings of ...
We characterize the extremal trees that maximize the number of almost-perfect matchings, which are m...
AbstractLet H = F(v) ⊕ G(w) denote the graph obtained from F and G by identifying vertices v of F an...
Very recently, Alon and Frankl initiated the study of the maximum number of edges in $n$-vertex $F$-...
[3] have recently determined the maximum number of edges of a chordal graph with a maximum degree le...
This dissertation answers several questions in extremal graph theory, each concerning the maximum or...
AbstractA subset S of vertices of a graph G is independent if no two vertices in S are adjacent. In ...
AbstractThe ratio of the number of edges in a smallest maximal matching to the number of vertices in...
Blair et. al. [3] have recently determined the maximum number of edges of a chordal graph with a max...
AbstractLet m(G,k) be the number of k-matchings in the graph G. We write G1 ⪯ G2 if m(G1, k) ≤ m(G2,...
This dissertation answers several questions in extremal graph theory, each concerning the maximum or...
We provide combinatorial decompositions as well as asymptotic tight estimates for two maximal parame...
AbstractA maximum stable set in a graph G is a stable set of maximum size. S is a local maximum stab...
AbstractFor a graph G, consider the pairs of edge-disjoint matchings whose union consists of as many...
DOI
Add to ORKG