A bound for size Ramsey numbers of multipartite graphs
From MaRDI portal
Publication:2372896
Summary: It is shown that the (diagonal) size Ramsey numbers of complete \(m\)-partite graphs \(K_{m}(n)\) can be bounded from below by \(cn^22^{(m-1)n}\), where \(c\) is a positive constant.
Recommendations
- Bounds on Ramsey numbers of certain complete bipartite graphs
- On size Ramsey numbers of graphs with bounded degree
- scientific article; zbMATH DE number 5054099
- On bounds for size Ramsey numbers of a complete tripartite graph
- Ramsey numbers in complete balanced multipartite graphs. II: Size numbers
- The size multipartite Ramsey numbers of large paths versus small graph
- Ramsey multiplicities of some graphs
- The size multipartite Ramsey numbers for small paths versus other graphs
- Multicolored Ramsey numbers in multipartite graphs
- Asymptotic Size Ramsey Results for Bipartite Graphs
Cited in
(8)- On bounds for size Ramsey numbers of a complete tripartite graph
- A bound for s-distance permutation families and explicit Ramsey graphs
- Size Ramsey number of bounded degree graphs for games
- Remarks on the application of Ramsey numbers to bounding the sum of densities of a graph and its complement
- Asymptotic Size Ramsey Results for Bipartite Graphs
- On shifted products which are powers
- scientific article; zbMATH DE number 5054099 (Why is no real title available?)
- The Size Ramsey Number of Graphs with Bounded Treewidth
This page was built for publication: A bound for size Ramsey numbers of multipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2372896)
