Multicolor Ramsey theory for a fan versus complete graphs
From MaRDI portal
Publication:6633247
Cites work
- scientific article; zbMATH DE number 2154973 (Why is no real title available?)
- scientific article; zbMATH DE number 969119 (Why is no real title available?)
- Combinatorial Relations and Chromatic Graphs
- Constructive Methods in Gallai-Ramsey Theory for Hypergraphs
- Edge-colored complete graphs with precisely colored subgraphs
- Gallai-Ramsey number for \(K_4\)
- Generalizations of a Ramsey-theoretic result of chvátal
- Generalized Ramsey theory for graphs. III: Small off-diagonal numbers
- Multicolor star-critical Ramsey numbers and Ramsey-good graphs
- On Ramsey and star-critical Ramsey numbers for generalized fans versus \(n K_m\)
- Ramsey Numbers Involving Graphs with Long Suspended Paths
- Ramsey number of \(K_3\) versus \(F_{3, n}\)
- Ramsey numbers for complete graphs versus generalized fans
- Some star-critical Ramsey numbers
- Star-Critical Ramsey Numbers for Graphs
- Star-critical Ramsey number of \(F_n\) versus \(K_4\)
- The Ramsey numbers of fans versus a complete graph of order five
- The graph Ramsey number \(R(F_\ell, K_6)\)
- Topics in Gallai-Ramsey Theory
This page was built for publication: Multicolor Ramsey theory for a fan versus complete graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6633247)