On size Ramsey number of paths, trees, and circuits. I

DOI10.1002/jgt.3190070115zbMath0508.05047WikidataQ105583217 ScholiaQ105583217MaRDI QIDQ4745847

József Beck

Publication date: 1983

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190070115

zbMATH Keywords

size Ramsey number; monochromatic copy; two-coloring

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

05C55: Generalized Ramsey theory

Related Items

Regular pairs in sparse random graphs I, A note on the Size-Ramsey number of long subdivisions of graphs, On an anti‐Ramsey property of Ramanujan graphs, The Induced Size-Ramsey Number of Cycles, Size Ramsey numbers for some regular graphs, The size-Ramsey number of trees, Expanding graphs contain all small trees, Local \(k\)-colorings of graphs and hypergraphs, Explicit construction of linear sized tolerant networks, A Ramsey type problem concerning vertex colourings, On the Ramsey number \(r(H+\overline{K_ n},K_ n)\), The structure of transform graphs, Remarks on the size Ramsey number of graphs, Remarks on a paper by H. Bielak on size Ramsey numbers, Large generalized books are \(p\)-good, Explicit construction of linear sized tolerant networks. (Reprint), A sharp threshold for the Hamilton cycle Maker–Breaker game, Diameters and Eigenvalues, The size Ramsey number of trees with bounded degree