The Ramsey number for a forest versus disjoint union of complete graphs
From MaRDI portal
Publication:2689113
Recommendations
Cites work
- Bounds for the ramsey number of a disconnected graph versus any graph
- Generalizations of a Ramsey-theoretic result of chvátal
- Generalized Ramsey theory for graphs. III: Small off-diagonal numbers
- scientific article; zbMATH DE number 3545699 (Why is no real title available?)
- On the Ramsey Number r(F, Km) Where F is a Forest
- Ramsey goodness and generalized stars
- Ramsey goodness of bounded degree trees
- Ramsey goodness of paths
- Ramsey Numbers Involving Graphs with Long Suspended Paths
- Ramsey-goodness -- and otherwise
- Recent developments in graph Ramsey theory
- Small Ramsey numbers
- The goodness of long path with respect to multiple copies of complete graphs
- The Ramsey number for a linear forest versus two identical copies of complete graphs
Cited in
(10)- THE RAMSEY NUMBER FOR A LINEAR FOREST VERSUS TWO IDENTICAL COPIES OF COMPLETE GRAPHS
- scientific article; zbMATH DE number 5872084 (Why is no real title available?)
- scientific article; zbMATH DE number 5714321 (Why is no real title available?)
- The Ramsey number for a linear forest versus two identical copies of complete graphs
- A large tree is \(tK_m\)-good
- The Ramsey Number for a Forest versus Disjoint Union of Complete Graphs
- Ramsey numbers of trees versus multiple copies of books
- Ramsey numbers of stripes versus trees and unicyclic graphs
- Ramsey numbers for a large tree versus multiple copies of complete graphs of different sizes
- Ramsey numbers for a disjoint union of good graphs
This page was built for publication: The Ramsey number for a forest versus disjoint union of complete graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2689113)