Name
Abstract | ||
|---|---|---|
A graph G is said to be C-l-saturated if G contains no cycle of length l, but for any edge in the complement of G the graph G + e does contain a cycle of length l. The minimum number of edges of a C-l-saturated graph was shown by Barefoot et al. to be between n+c(1) n/l and n+c(2) nl for some positive constants c(1) and c(2). This confirmed a conjecture of Bollobas. Here we improve the value of c(2) for l >= 8. |
Year | Venue | Keywords |
|---|---|---|
2006 | ELECTRONIC JOURNAL OF COMBINATORICS | upper bound |
Field | DocType | Volume |
Graph,Discrete mathematics,Combinatorics,Constructive,Conjecture,Mathematics | Journal | 13.0 |
Issue | ISSN | Citations |
1.0 | 1077-8926 | 9 |
PageRank | References | Authors |
0.79 | 6 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ronald J. Gould | 1 | 641 | 94.81 |
| Tomasz Luczak | 2 | 596 | 130.60 |
| John Schmitt | 3 | 13 | 1.41 |