Small Ramsey numbers

From MaRDI portal
Publication:1379158

zbMath0953.05048MaRDI QIDQ1379158

Stanislaw P. Radziszowski

Publication date: 22 February 1998

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/120722




Related Items (71)

Ramsey numbers of fans and large booksEdge-colorings of graphs avoiding complete graphs with a prescribed coloringUnnamed ItemExpressing Symmetry Breaking in DRAT ProofsMutually touching infinite cylinders in the 3D world of linesGeneralized Ramsey numbers through adiabatic quantum optimizationPoset Ramsey numbers for Boolean latticesGallai-Ramsey numbers for graphs with five vertices of chromatic number fourBreaking symmetries in graph search with canonizing setsComputing the Ramsey number \(R(4,3,3)\) using abstraction and symmetry breakingSmall minimal $(3, 3)$-Ramsey graphsRamsey numbers \(r(K_ 3,G)\) for connected graphs \(G\) of order sevenGallai-Ramsey numbers for a class of graphs with five verticesLarge chromatic number and Ramsey graphsGeneralized Paley graphs and their complete subgraphs of orders three and fourSome multi-color Ramsey numbers on stars versus path, cycle or wheelAlmost-equidistant setsExact values of multicolor Ramsey numbers \(R_l(C_{\le l+1})\)Stars versus stripes Ramsey numbersOn Ramsey (\(K_{1,m},\mathcal{G}\))-minimal graphsOn Multicolor Ramsey Numbers and Subset Coloring of HypergraphsOn the restricted size Ramsey number involving a path \(P_3\)On the van der Waerden numbers \(\mathrm{w}(2; 3, t)\)The Ramsey numbers of trees versus generalized 6-wheels or generalized 7-wheelsStar-critical Gallai-Ramsey numbers of graphsForcing \(k\)-repetitions in degree sequencesComplete graphs and complete bipartite graphs without rainbow pathOn some generalized vertex Folkman numbersOn three-color Ramsey number of pathsRamsey numbers of \(C_4\) versus wheels and starsAll complete graph-wheel planar Ramsey numbersThree results on cycle-wheel Ramsey numbersRamsey-Turán type results for matchings in edge colored graphsSize Gallai-Ramsey numberA generalised linear Ramsey graph constructionThe minimum semidefinite rank of a triangle-free graphThe Ramsey number for a forest versus disjoint union of complete graphsThree-Color Bipartite Ramsey Number for Graphs with Small BandwidthMonochromatic partitions in local edge coloringsStar-critical Ramsey numbers for cycles versus \(K_4\)On-line Ramsey numbers of paths and cyclesOn multicolor Ramsey numbers for loose \(k\)-paths of length threeAdvances on defective parameters in graphsSemidefinite Programming and Ramsey NumbersUnnamed ItemUnnamed ItemOn the nonexistence of some generalized Folkman numbersOn characterizing the critical graphs for matching Ramsey numbersRamsey-goodness -- and otherwiseOptimal symmetry breaking for graph problemsGeneralized and geometric Ramsey numbers for cycles.Obstacle numbers of graphsUnnamed ItemNew lower bounds of classical Ramsey numbers \(R(6,12)\), \(R(6,14)\) and \(R(6,15)\)Ramsey numbers of trees versus odd cyclesOn the multi-colored Ramsey numbers of paths and even cyclesA class of Ramsey-extremal hypergraphsNew lower bounds for 28 classical Ramsey numbersOn Ramsey numbers \(R(K_4-e, K_t)\)A degree sequence variant of graph Ramsey numbersUnnamed ItemOn the Size-Ramsey Number of CyclesAn adaptive upper bound on the Ramsey numbers $R(3,\dots,3)$The Ramsey number of 3-uniform loose path versus starCombinatorial properties of the enhanced principal rank characteristic sequence over finite fieldsStability of the path-path Ramsey numberRamsey Numbers Involving Large BooksEndgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete.Ramsey numbers for complete graphs versus generalized fansNon-separating spanning trees and out-branchings in digraphs of independence number 2On the independence number of $(3, 3)$-Ramsey graphs and the Folkman number $F_e(3, 3; 4)$




This page was built for publication: Small Ramsey numbers