[3] have recently determined the maximum number of edges of a chordal graph with a maximum degree less than $d$ and the matching number at most $\nu$ by exhibiting a family of chordal graphs achieving this bound. We provide simple proof of their result
Very recently, Alon and Frankl initiated the study of the maximum number of edges in $n$-vertex $F$-...
AbstractFor a graph G, consider the pairs of edge-disjoint matchings whose union consists of as many...
This dissertation answers several questions in extremal graph theory, each concerning the maximum or...
Blair et. al. [3] have recently determined the maximum number of edges of a chordal graph with a max...
AbstractWe examine classes of extremal graphs for the inequality γ(G)⩽|V|-max{d(v)+βv(G)}, where γ(G...
In extremal graph theory, we ask how large or small a property of a graph can be, when the graph has...
AbstractLet n, b, d be positive integers. We evaluate f(n, b, d), the largest possible number of edg...
An induced matching in a graph is a set of edges such that no two edges in the set are joined by any...
We determine the maximum possible number of edges of a graph with $n$ vertices, matching number at m...
AbstractWe examine classes of extremal graphs for the inequality γ(G)⩽|V|-max{d(v)+βv(G)}, where γ(G...
New results are proved on several problems in extremal graph theory.Let $ex\sp*(D;H)$ denote the max...
New results are proved on several problems in extremal graph theory.Let $ex\sp*(D;H)$ denote the max...
Research Doctorate - Doctor of Philosophy (PhD)The question of Turán on the maximum number of edges ...
This dissertation consists of six chapters concerning a variety of topics in extremal graph theory.C...
Let λ(G) denote the smallest number of vertices that can be removed from a non-empty graph G so tha...
Very recently, Alon and Frankl initiated the study of the maximum number of edges in $n$-vertex $F$-...
AbstractFor a graph G, consider the pairs of edge-disjoint matchings whose union consists of as many...
This dissertation answers several questions in extremal graph theory, each concerning the maximum or...
Blair et. al. [3] have recently determined the maximum number of edges of a chordal graph with a max...
AbstractWe examine classes of extremal graphs for the inequality γ(G)⩽|V|-max{d(v)+βv(G)}, where γ(G...
In extremal graph theory, we ask how large or small a property of a graph can be, when the graph has...
AbstractLet n, b, d be positive integers. We evaluate f(n, b, d), the largest possible number of edg...
An induced matching in a graph is a set of edges such that no two edges in the set are joined by any...
We determine the maximum possible number of edges of a graph with $n$ vertices, matching number at m...
AbstractWe examine classes of extremal graphs for the inequality γ(G)⩽|V|-max{d(v)+βv(G)}, where γ(G...
New results are proved on several problems in extremal graph theory.Let $ex\sp*(D;H)$ denote the max...
New results are proved on several problems in extremal graph theory.Let $ex\sp*(D;H)$ denote the max...
Research Doctorate - Doctor of Philosophy (PhD)The question of Turán on the maximum number of edges ...
This dissertation consists of six chapters concerning a variety of topics in extremal graph theory.C...
Let λ(G) denote the smallest number of vertices that can be removed from a non-empty graph G so tha...
Very recently, Alon and Frankl initiated the study of the maximum number of edges in $n$-vertex $F$-...
AbstractFor a graph G, consider the pairs of edge-disjoint matchings whose union consists of as many...
This dissertation answers several questions in extremal graph theory, each concerning the maximum or...
DOI
Add to ORKG