Multipartite graph-sparse graph Ramsey numbers

DOI10.1007/BF02579245zbMath0593.05050OpenAlexW2018470147WikidataQ105941622 ScholiaQ105941622MaRDI QIDQ1076043

Paul Erdős, Richard H. Schelp, Cecil C. Rousseau, Ralph J. Faudree

Publication date: 1985

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579245

zbMATH Keywords

Ramsey numbersufficiently large sparse connected graph

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Related Items

Goodness of trees for generalized books ⋮ Ramsey goodness of paths ⋮ Extremal theory and bipartite graph-tree Ramsey numbers ⋮ Small order graph-tree Ramsey numbers ⋮ A large tree is \(tK_m\)-good ⋮ Ramsey goodness of trees in random graphs ⋮ Ramsey numbers involving a long path ⋮ Maximum clique deleted from Ramsey graphs of a graph and paths ⋮ Ramsey Goodness of Bounded Degree Trees ⋮ Ramsey regions ⋮ Ramsey Goodness of Clique Versus Paths in Random Graphs ⋮ The Size Ramsey Number of Graphs with Bounded Treewidth ⋮ On graphs \(G\) for which all large trees are \(G\)-good

Cites Work

• Unnamed Item
• Ramsey numbers for cycles in graphs
• Ramsey Numbers for the Pair Sparse Graph-Path or Cycle
• Ramsey Numbers Involving Graphs with Long Suspended Paths
• Ramsey Graphs and Block Designs. I
• On Representatives of Subsets