An extremal problem for paths in bipartite graphs
From MaRDI portal
Publication:3697038
DOI10.1002/jgt.3190080109zbMath0576.05031OpenAlexW2005815063MaRDI QIDQ3697038
András Gyárfás, Richard H. Schelp, Cecil C. Rousseau
Publication date: 1984
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190080109
Related Items
On some three-color Ramsey numbers for paths ⋮ All Ramsey numbers for brooms in graphs ⋮ Extremal theory and bipartite graph-tree Ramsey numbers ⋮ Exact bipartite Turán numbers of large even cycles ⋮ Inverting the Turán problem ⋮ The bipartite Turán number and spectral extremum for linear forests ⋮ Kalai's conjecture in \(r\)-partite \(r\)-graphs ⋮ On the cycle-path bipartite Ramsey number ⋮ Random bipartite Ramsey numbers of long cycles ⋮ Bipartite Ramsey numbers of paths for random graphs ⋮ Extremal problems involving vertices and edges on odd cycles ⋮ Bipartite Ramsey numbers for graphs of small bandwidth ⋮ A variation of the Erdős-Sós conjecture in bipartite graphs ⋮ Bipartite Ramsey numbers of cycles for random graphs ⋮ On a problem of Erdős on integers, none of which divides the product of \(k\) others ⋮ Homomorphism thresholds for odd cycles ⋮ Inverse Turán numbers
This page was built for publication: An extremal problem for paths in bipartite graphs