AbstractFor integers n≥4 and ν≥n+1, let ex(ν;{C3,C4,…,Cn}) denote the maximum number of edges in a graph with ν vertices and girth at least n+1. In this paper we have obtained bounds on this function for n∈{5,6,7} and, in several cases, even the exact value. We have also developed a greedy algorithm for generating graphs with large size for given order and girth
Several upper bounds are given for the maximum number of edges e possible in a graph depending upon ...
© 2020 Elsevier Inc. Given a graph H and a set of graphs F, let ex(n,H,F) denote the maximum possibl...
AbstractThe girth of graph G is the length of the shortest cycle in G; if G has no cycle, we define ...
By extremal number ex(n;t ) = ex(n;{C₃, C₄, ..., Ct}) we denote the maximum size (that is, number of...
AbstractWe denote by ex(n;{C3,C4,…,Cs}) or fs(n) the maximum number of edges in a graph of order n a...
By the extremal number ex(n;t) = ex(n;{C₃,C₄,…,Ct}) we denote the maximum size (number of edges) in ...
By the extremal numberex(v;{C₃,C₄,…,Cn}) we denote the maximum number of edges in a graph of order v...
AbstractThe girth of graph G is the length of the shortest cycle in G; if G has no cycle, we define ...
AbstractFor integers n≥4 and ν≥n+1, let ex(ν;{C3,C4,…,Cn}) denote the maximum number of edges in a g...
AbstractFor integers n≥4 and ν≥n+1, let ex(ν;{C3,…,Cn}) denote the maximum number of edges in a grap...
We denote by ex $(n; {C^3,C^4,…Cs})$ or fs(n) the maximum number of edges in a graph of order n and ...
Several upper bounds are given for the maximum number of edges e possible in a graph depending upon ...
AbstractThe extremal number ex(n;TKp) denotes the maximum number of edges of a graph of order n cont...
AbstractBy the extremal number ex(v;{C3,C4,…,Cn}) we denote the maximum number of edges in a graph o...
In 1975, Erdos proposed the problem of determining the maximal number of edges in a graph on n verti...
Several upper bounds are given for the maximum number of edges e possible in a graph depending upon ...
© 2020 Elsevier Inc. Given a graph H and a set of graphs F, let ex(n,H,F) denote the maximum possibl...
AbstractThe girth of graph G is the length of the shortest cycle in G; if G has no cycle, we define ...
By extremal number ex(n;t ) = ex(n;{C₃, C₄, ..., Ct}) we denote the maximum size (that is, number of...
AbstractWe denote by ex(n;{C3,C4,…,Cs}) or fs(n) the maximum number of edges in a graph of order n a...
By the extremal number ex(n;t) = ex(n;{C₃,C₄,…,Ct}) we denote the maximum size (number of edges) in ...
By the extremal numberex(v;{C₃,C₄,…,Cn}) we denote the maximum number of edges in a graph of order v...
AbstractThe girth of graph G is the length of the shortest cycle in G; if G has no cycle, we define ...
AbstractFor integers n≥4 and ν≥n+1, let ex(ν;{C3,C4,…,Cn}) denote the maximum number of edges in a g...
AbstractFor integers n≥4 and ν≥n+1, let ex(ν;{C3,…,Cn}) denote the maximum number of edges in a grap...
We denote by ex $(n; {C^3,C^4,…Cs})$ or fs(n) the maximum number of edges in a graph of order n and ...
Several upper bounds are given for the maximum number of edges e possible in a graph depending upon ...
AbstractThe extremal number ex(n;TKp) denotes the maximum number of edges of a graph of order n cont...
AbstractBy the extremal number ex(v;{C3,C4,…,Cn}) we denote the maximum number of edges in a graph o...
In 1975, Erdos proposed the problem of determining the maximal number of edges in a graph on n verti...
Several upper bounds are given for the maximum number of edges e possible in a graph depending upon ...
© 2020 Elsevier Inc. Given a graph H and a set of graphs F, let ex(n,H,F) denote the maximum possibl...
AbstractThe girth of graph G is the length of the shortest cycle in G; if G has no cycle, we define ...
DOI
Add to ORKG