Name
Abstract | ||
|---|---|---|
We investigate the minimum, taken over all graphs G with n vertices and at least ⌊ n 2 /4⌋ + 1 edges, of the number of vertices and edges of G which are on cycles of length 2 k + 1. |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1016/0012-365X(92)90586-5 | Discrete Mathematics |
Keywords | Field | DocType |
odd cycle,extremal problem | Discrete mathematics,Combinatorics,Path (graph theory),Hypercube graph,Vertex (geometry),Vertex (graph theory),Neighbourhood (graph theory),Cycle graph,Mathematics,Path graph,Topological graph | Journal |
Volume | Issue | ISSN |
101 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
2 | 0.37 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| P. Erdős | 1 | 2 | 0.37 |
| R. J. Faudree | 2 | 174 | 38.15 |
| C. C. Rousseau | 3 | 126 | 22.97 |