Multipartite graph-sparse graph Ramsey numbers
From MaRDI portal
Publication:1076043
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
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