On three-color Ramsey numbers R(C₄,K₁,m,P_n)
From MaRDI portal
Publication:1633285
Recommendations
Cites work
- Graphs from projective planes
- Graphs without four-cycles
- scientific article; zbMATH DE number 3232670 (Why is no real title available?)
- On Graphs that do not Contain a Thomsen Graph
- On maximal paths and circuits of graphs
- On the number of edges of quadrilateral-free graphs
- Polarity graphs and Ramsey numbers for \(C_4\) versus stars
- Ramsey Graphs and Block Designs. I
- Über ein Problem von K. Zarankiewicz
Cited in
(12)- Some three-color Ramsey numbers, R(P₄,P₅,C_k) and R(P₄,P₆,C_k)
- On three color Ramsey numbers \(R(C_4, C_4, K_{1, n})\)
- Three color Ramsey numbers for graphs with at most 4 vertices
- On the 3-color Ramsey numbers R(C₄,C₄,W_n)
- The first nontrivial three color upper domination in Ramsey number is 13
- On the independence number of (3, 3)-Ramsey graphs and the Folkman number F_e(3, 3; 4)
- On the three color Ramsey numbers R(C_m,C₄,C₄).
- scientific article; zbMATH DE number 1556757 (Why is no real title available?)
- On Some Multicolor Ramsey Numbers Involving K₃+e and K₄-e
- Polarity graphs and Ramsey numbers for \(C_4\) versus stars
- scientific article; zbMATH DE number 7104556 (Why is no real title available?)
- The Ramsey numbers for disjoint unions of graphs
This page was built for publication: On three-color Ramsey numbers \(R(C_{4},K_{1,m},P_{n})\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1633285)