Skip to main navigation Skip to search Skip to main content

On the Turán Numbers of Linear Forests in Bipartite Graphs

  • Tianying Xie*
  • , Longtu Yuan*
  • *Corresponding author for this work
  • University of Science and Technology of China

Research output: Contribution to journal › Article › peer-review

Abstract

A linear forest is a graph consisting of paths. In this paper, the authors determine the maximum number of edges in an (m, n)-bipartite graph which does not contain a linear forest consisting of paths on at least four vertices for n ≥ m when m is sufficiently large.

Original languageEnglish
Pages (from-to)709-732
Number of pages24
JournalChinese Annals of Mathematics. Series B
Volume45
Issue number5
DOIs
StatePublished - Sep 2024

Keywords

  • 05C05
  • 05C35
  • Bipartite graph
  • Linear forest
  • Turán number

Fingerprint

Dive into the research topics of 'On the Turán Numbers of Linear Forests in Bipartite Graphs'. Together they form a unique fingerprint.

Cite this