The Ramsey number for stripes
From MaRDI portal
Publication:4079631
DOI10.1017/S1446788700029554zbMath0318.05109OpenAlexW2042340160MaRDI QIDQ4079631
Publication date: 1975
Published in: Journal of the Australian Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s1446788700029554
Related Items
Star Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp, The ith Ramsey number for matchings, Ramsey numbers for local colorings, Ramsey-nice families of graphs, On small balanceable, strongly-balanceable and omnitonal graphs, Sub-Ramsey numbers for matchings, Stars versus stripes Ramsey numbers, Exponentially many monochromatic \(n\)-matchings in \(K_{3n-1}\), Lower bounds on the number of monochromatic matchings in \(K_{2s+t-1}\), List Ramsey numbers, Color‐biased Hamilton cycles in random graphs, Class Ramsey numbers involving induced graphs, Ordered Ramsey numbers of loose paths and matchings, Ramsey-Turán type results for matchings in edge colored graphs, Restricted online Ramsey numbers of matchings and trees, Star-critical Ramsey numbers, Monochromatic spanning trees and matchings in ordered complete graphs, Upper density of monochromatic paths in edge-coloured infinite complete graphs and bipartite graphs, Exact Ramsey numbers of odd cycles via nonlinear optimisation, All partitions have small parts -- Gallai-Ramsey numbers of bipartite graphs, Ramsey numbers of path-matchings, covering designs, and 1-cores, Coverings by few monochromatic pieces: a transition between two Ramsey problems, Constrained Ramsey numbers for rainbow matching, A generalization of Ramsey theory for linear forests, More on monochromatic-rainbow Ramsey type theorems, The Ramsey numbers for stripes and complete graphs 1, On characterizing the critical graphs for matching Ramsey numbers, On the Erdős-Ginzburg-Ziv theorem and the Ramsey numbers for stars and matchings, On Ramsey numbers for linear forests, The Chromatic Number of Kneser Hypergraphs, A method in graph theory, Ramsey numbers for quadrangles and triangles, Chromatic Ramsey number of acyclic hypergraphs, Maximum subgraphs in Ramsey graphs, A note on restricted online Ramsey numbers of matchings, Matchings with few colors in colored complete graphs and hypergraphs, Ramsey Number of a Connected Triangle Matching, On geometric graph Ramsey numbers, Extremal problems concerning Kneser-graphs, The third Ramsey numbers for graphs with at most four edges, Gallai-Ramsey numbers for rainbow \(S_3^+\) and monochromatic paths
