### Abstract

A formula is found for the maximum number of edges in a graph G ⊆ K(a, b) which contains no path P_{2l} for l > c. A similar formula is found for the maximum number of edges in G ⊆ K(a, b) containing no P_{2l + 1} for l > c. In addition, all extremal graphs are determined.

Original language | English |
---|---|

Pages (from-to) | 83-95 |

Number of pages | 13 |

Journal | Journal of Graph Theory |

Volume | 8 |

Issue number | 1 |

DOIs | |

Publication status | Published - 1984 |

### Fingerprint

### ASJC Scopus subject areas

- Geometry and Topology

### Cite this

*Journal of Graph Theory*,

*8*(1), 83-95. https://doi.org/10.1002/jgt.3190080109

**An extremal problem for paths in bipartite graphs.** / Gyárfás, A.; Rousseau, C. C.; Schelp, R. H.

Research output: Contribution to journal › Article

*Journal of Graph Theory*, vol. 8, no. 1, pp. 83-95. https://doi.org/10.1002/jgt.3190080109

}

TY - JOUR

T1 - An extremal problem for paths in bipartite graphs

AU - Gyárfás, A.

AU - Rousseau, C. C.

AU - Schelp, R. H.

PY - 1984

Y1 - 1984

N2 - A formula is found for the maximum number of edges in a graph G ⊆ K(a, b) which contains no path P2l for l > c. A similar formula is found for the maximum number of edges in G ⊆ K(a, b) containing no P2l + 1 for l > c. In addition, all extremal graphs are determined.

AB - A formula is found for the maximum number of edges in a graph G ⊆ K(a, b) which contains no path P2l for l > c. A similar formula is found for the maximum number of edges in G ⊆ K(a, b) containing no P2l + 1 for l > c. In addition, all extremal graphs are determined.

UR - http://www.scopus.com/inward/record.url?scp=70349592193&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70349592193&partnerID=8YFLogxK

U2 - 10.1002/jgt.3190080109

DO - 10.1002/jgt.3190080109

M3 - Article

VL - 8

SP - 83

EP - 95

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 1

ER -