The Ramsey number for stripes

From MaRDI portal
Revision as of 05:46, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4079631

DOI10.1017/S1446788700029554zbMath0318.05109OpenAlexW2042340160MaRDI QIDQ4079631

E. J. Cockayne, P. J. Lorimer

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 (41)

Star Versus Two Stripes Ramsey Numbers and a Conjecture of SchelpThe ith Ramsey number for matchingsRamsey numbers for local coloringsRamsey-nice families of graphsOn small balanceable, strongly-balanceable and omnitonal graphsSub-Ramsey numbers for matchingsStars versus stripes Ramsey numbersExponentially many monochromatic \(n\)-matchings in \(K_{3n-1}\)Lower bounds on the number of monochromatic matchings in \(K_{2s+t-1}\)List Ramsey numbersColor‐biased Hamilton cycles in random graphsClass Ramsey numbers involving induced graphsOrdered Ramsey numbers of loose paths and matchingsRamsey-Turán type results for matchings in edge colored graphsRestricted online Ramsey numbers of matchings and treesStar-critical Ramsey numbersMonochromatic spanning trees and matchings in ordered complete graphsUpper density of monochromatic paths in edge-coloured infinite complete graphs and bipartite graphsExact Ramsey numbers of odd cycles via nonlinear optimisationAll partitions have small parts -- Gallai-Ramsey numbers of bipartite graphsRamsey numbers of path-matchings, covering designs, and 1-coresCoverings by few monochromatic pieces: a transition between two Ramsey problemsConstrained Ramsey numbers for rainbow matchingA generalization of Ramsey theory for linear forestsMore on monochromatic-rainbow Ramsey type theoremsThe Ramsey numbers for stripes and complete graphs 1On characterizing the critical graphs for matching Ramsey numbersOn the Erdős-Ginzburg-Ziv theorem and the Ramsey numbers for stars and matchingsOn Ramsey numbers for linear forestsThe Chromatic Number of Kneser HypergraphsA method in graph theoryRamsey numbers for quadrangles and trianglesChromatic Ramsey number of acyclic hypergraphsMaximum subgraphs in Ramsey graphsA note on restricted online Ramsey numbers of matchingsMatchings with few colors in colored complete graphs and hypergraphsRamsey Number of a Connected Triangle MatchingOn geometric graph Ramsey numbersExtremal problems concerning Kneser-graphsThe third Ramsey numbers for graphs with at most four edgesGallai-Ramsey numbers for rainbow \(S_3^+\) and monochromatic paths







This page was built for publication: The Ramsey number for stripes