Extremal theory and bipartite graph-tree Ramsey numbers

DOI10.1016/0012-365X(88)90198-7zbMath0659.05066MaRDI QIDQ1112065

Ralph J. Faudree, Richard H. Schelp, Cecil C. Rousseau

Publication date: 1988

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

bipartite graphsRamsey numberstreesextremal Ramsey theory

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55)

Related Items (1)

A neighborhood condition which implies the existence of a class of d‐chromatic subgraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multipartite graph-sparse graph Ramsey numbers
• Goodness of trees for generalized books
• Cycles of even length in graphs
• Ramsey Numbers for the Pair Sparse Graph-Path or Cycle
• On Ramsey numbers involving starlike multipartite graphs
• An extremal problem for paths in bipartite graphs
• On Representatives of Subsets

This page was built for publication: Extremal theory and bipartite graph-tree Ramsey numbers