On three-color Ramsey numbers R(C₄,K₁,m,P_n)
From MaRDI portal
Publication:1633285
DOI10.1016/J.FFA.2018.09.007zbMATH Open1457.05067OpenAlexW2892805307WikidataQ129183939 ScholiaQ129183939MaRDI QIDQ1633285FDOQ1633285
Authors: Fangfang Zhang, Yunqing Zhang, Yaojun Chen 
Publication date: 19 December 2018
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2018.09.007
Recommendations
Generalized Ramsey theory (05C55) Combinatorial structures in finite projective spaces (51E20) Ramsey theory (05D10)
Cites Work
- On maximal paths and circuits of graphs
- Über ein Problem von K. Zarankiewicz
- On Graphs that do not Contain a Thomsen Graph
- Title not available (Why is that?)
- On the number of edges of quadrilateral-free graphs
- Graphs without four-cycles
- Graphs from projective planes
- Ramsey Graphs and Block Designs. I
- Polarity graphs and Ramsey numbers for \(C_4\) versus stars
Cited In (12)
- The Ramsey numbers for disjoint unions of graphs
- On Some Multicolor Ramsey Numbers Involving $K_3+e$ and $K_4-e$
- Title not available (Why is that?)
- Some three-color Ramsey numbers, \(R(P_4,P_5,C_k)\) and \(R(P_4,P_6,C_k)\)
- On three color Ramsey numbers \(R(C_4, C_4, K_{1, n})\)
- On the three color Ramsey numbers \(R(C_m,C_4,C_4)\).
- On the independence number of $(3, 3)$-Ramsey graphs and the Folkman number $F_e(3, 3; 4)$
- On the 3-color Ramsey numbers \(R(C_4,C_4,W_n)\)
- The first nontrivial three color upper domination in Ramsey number is 13
- Three color Ramsey numbers for graphs with at most 4 vertices
- Polarity graphs and Ramsey numbers for \(C_4\) versus stars
- Title not available (Why is that?)
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)
