Add to ORKGA long standing open problem in extremal graph theory is to describe all graphs that maximize the number of induced copies of a path on four vertices. The character of the problem changes in the setting of oriented graphs, and becomes more tractable. Here we resolve this problem in the setting of oriented graphs without transitive triangles
AbstractAn exact bound is obtained for the number of edges in a directed graph which ensures the exi...
AbstractWe prove some sufficient conditions for a directed graph to have the property of a conjectur...
We consider the class of directed graphs with $N$ edges and without loops shorter than k. Using the ...
AbstractWe consider directed graphs without loops and multiple edges, where the exclusion of multipl...
AbstractWe consider directed graphs without loops and multiple edges, where the exclusion of multipl...
This dissertation consists of six chapters concerning a variety of topics in extremal graph theory.C...
One of the cornerstones of extremal graph theory is a result of Füredi, later reproved and given due...
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...
One of the cornerstones of extremal graph theory is a result of Füredi, later reproved and given due...
It is proved that every strongly connected directed graph with n nodes and at least ⌊(n + 1)²/4 ⌋ ed...
AbstractWe investigate the maximum number of ways in which a k-vertex graph G can appear as an induc...
We prove some sufficient conditions for a directed graph to have the property of a conjecture of J.M...
One of the cornerstones of extremal graph theory is a result of Füredi, later reproved and given due...
Research Doctorate - Doctor of Philosophy (PhD)The question of Turán on the maximum number of edges ...
AbstractAn exact bound is obtained for the number of edges in a directed graph which ensures the exi...
AbstractWe prove some sufficient conditions for a directed graph to have the property of a conjectur...
We consider the class of directed graphs with $N$ edges and without loops shorter than k. Using the ...
AbstractWe consider directed graphs without loops and multiple edges, where the exclusion of multipl...
AbstractWe consider directed graphs without loops and multiple edges, where the exclusion of multipl...
This dissertation consists of six chapters concerning a variety of topics in extremal graph theory.C...
One of the cornerstones of extremal graph theory is a result of Füredi, later reproved and given due...
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...
One of the cornerstones of extremal graph theory is a result of Füredi, later reproved and given due...
It is proved that every strongly connected directed graph with n nodes and at least ⌊(n + 1)²/4 ⌋ ed...
AbstractWe investigate the maximum number of ways in which a k-vertex graph G can appear as an induc...
We prove some sufficient conditions for a directed graph to have the property of a conjecture of J.M...
One of the cornerstones of extremal graph theory is a result of Füredi, later reproved and given due...
Research Doctorate - Doctor of Philosophy (PhD)The question of Turán on the maximum number of edges ...
AbstractAn exact bound is obtained for the number of edges in a directed graph which ensures the exi...
AbstractWe prove some sufficient conditions for a directed graph to have the property of a conjectur...
We consider the class of directed graphs with $N$ edges and without loops shorter than k. Using the ...