An extremal problem for paths in bipartite graphs

DOI10.1002/JGT.3190080109MaRDI QIDQ3697038zbMATH OpenOpenAlexFDO

Authors András Gyárfás, R. H. Schelp, Cecil 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

zbMATH Keywords

bipartite graphsextremal problempaths

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Recommendations

• An extremal problem resulting in many paths.
• scientific article; zbMATH DE number 4103103
• Maximum number of edges of a bipartite graph without complete bipartite subgraphs
• Two path extremal graphs and an application to a Ramsey-type problem
• Extremal <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>K</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)<

Cited in

(37)

• On a problem of Erdős on integers, none of which divides the product of k others
• On Enomoto's problems in a bipartite graph
• Extremal theory and bipartite graph-tree Ramsey numbers
• Extremal problems involving vertices and edges on odd cycles
• Two path extremal graphs and an application to a Ramsey-type problem
• Bipartite Ramsey numbers of paths for random graphs
• Bipartite Ramsey numbers for graphs of small bandwidth
• Locally bipartite graphs
• On the number of alternating paths in bipartite complete graphs
• A variation of the Erdős-Sós conjecture in bipartite graphs
• Bipartite Ramsey numbers of cycles for random graphs
• Inverse Turán numbers
• Extremal graphs of the \(p\)th power of paths
• Inverting the Turán problem
• Extremal problems of Erdős, Faudree, Schelp and Simonovits on paths and cycles
• On some three-color Ramsey numbers for paths
• The number of edge covers of bipartite graphs or of shortest paths with fixed endpoints in the space of compact sets in \(R^n\)
• All Ramsey numbers for brooms in graphs
• An extremal problem resulting in many paths.
• scientific article; zbMATH DE number 4070665 (Why is no real title available?)
• scientific article; zbMATH DE number 4103103 (Why is no real title available?)
• scientific article; zbMATH DE number 15372 (Why is no real title available?)
• scientific article; zbMATH DE number 1786512 (Why is no real title available?)
• Paths in bipartite graphs with color‐inverting involutions
• scientific article; zbMATH DE number 7771746 (Why is no real title available?)
• Exact bipartite Turán numbers of large even cycles
• 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
• On the Turán numbers of linear forests in bipartite graphs
• Bipartite Ramsey number pairs that involve combinations of cycles and odd paths
• Generalized Ramsey numbers of cycles, paths, and hypergraphs
• Bipartite Ramsey number pairs involving cycles
• Extremal graphs for even linear forests in bipartite graphs
• The bipartite Turán number of independent cycles with different lengths
• Homomorphism thresholds for odd cycles

This page was built for publication: An extremal problem for paths in bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3697038)