An extremal problem for paths in bipartite graphs
From MaRDI portal
Publication:3697038
DOI10.1002/jgt.3190080109zbMath0576.05031MaRDI 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, Homomorphism thresholds for odd cycles, On a problem of Erdős on integers, none of which divides the product of \(k\) others, Extremal theory and bipartite graph-tree Ramsey numbers, Extremal problems involving vertices and edges on odd cycles, Bipartite Ramsey numbers of paths for random graphs, Bipartite Ramsey numbers for graphs of small bandwidth, A variation of the Erdős-Sós conjecture in bipartite graphs, Inverting the Turán problem