Name
Abstract | ||
|---|---|---|
For a bipartite graph the extremal number for the existence of a specific odd (even) length path was determined in J. Graph Theory 8 (1984), 83-95. In this article, we conjecture that for a balanced bipartite graph with partite sets of odd order the extremal number for an even order path guarantees many more paths of differing lengths. The conjecture is proved for a linear portion of the conjectured paths. |
Year | Venue | Keywords |
|---|---|---|
2014 | ARS COMBINATORIA | Extremal Number,Path Lengths,Balanced Bipartite Graphs |
Field | DocType | Volume |
Discrete mathematics,Mathematics | Journal | 116 |
ISSN | Citations | PageRank |
0381-7032 | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Richard H. Schelp | 1 | 0 | 0.34 |
| Kiyoshi Yoshimoto | 2 | 133 | 22.65 |