On size Ramsey number of paths, trees, and circuits. I
From MaRDI portal
Publication:4745847
DOI10.1002/jgt.3190070115zbMath0508.05047OpenAlexW4241497605WikidataQ105583217 ScholiaQ105583217MaRDI QIDQ4745847
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
Related Items (69)
The vertex size-Ramsey number ⋮ Degree Ramsey Numbers of Graphs ⋮ On the size-Ramsey number of grid graphs ⋮ Short proofs for long induced paths ⋮ Remarks on a paper by H. Bielak on size Ramsey numbers ⋮ Large generalized books are \(p\)-good ⋮ On the minimum degree of minimal Ramsey graphs for multiple colours ⋮ The size‐Ramsey number of trees ⋮ Expanding graphs contain all small trees ⋮ Local \(k\)-colorings of graphs and hypergraphs ⋮ On the Ramsey number \(r(H+\overline{K_ n},K_ n)\) ⋮ Explicit construction of linear sized tolerant networks ⋮ Rolling backwards can move you forward: On embedding problems in sparse expanders ⋮ The structure of transform graphs ⋮ Note on the multicolour size-Ramsey number for paths ⋮ Degree Ramsey numbers for even cycles ⋮ On the Size-Ramsey Number of Tight Paths ⋮ On an anti‐Ramsey property of Ramanujan graphs ⋮ On the discrepancies of graphs ⋮ Packing nearly optimal Ramsey \(R(3,t)\) graphs ⋮ A note on lower bounds for induced Ramsey numbers ⋮ The size‐Ramsey number of cubic graphs ⋮ The oriented size Ramsey number of directed paths ⋮ The size‐Ramsey number of short subdivisions ⋮ Online Ramsey theory for planar graphs ⋮ Monochromatic paths in random tournaments ⋮ The size Ramsey number of trees with bounded degree ⋮ The size Ramsey number of a directed path ⋮ On some Multicolor Ramsey Properties of Random Graphs ⋮ Size Gallai-Ramsey number ⋮ The Induced Size-Ramsey Number of Cycles ⋮ On the restricted size Ramsey number for a pair of cycles ⋮ Off-diagonal online size Ramsey numbers for paths ⋮ The multicolour size-Ramsey number of powers of paths ⋮ Sparse partition universal graphs for graphs of bounded degree ⋮ An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ Path Ramsey Number for Random Graphs ⋮ An analogue of the Erdős-Gallai theorem for random graphs ⋮ On-line size Ramsey number for monotone \(k\)-uniform ordered paths with uniform looseness ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ The size Ramsey number of short subdivisions of bounded degree graphs ⋮ On-line Ramsey numbers of paths and cycles ⋮ Degree bipartite Ramsey numbers ⋮ Ramsey Goodness of Clique Versus Paths in Random Graphs ⋮ Size Ramsey numbers for some regular graphs ⋮ Size-Ramsey numbers of cycles versus a path ⋮ The size-Ramsey number of 3-uniform tight paths ⋮ Size Ramsey numbers for some regular graphs ⋮ Almost‐spanning universality in random graphs ⋮ Explicit construction of linear sized tolerant networks. (Reprint) ⋮ A note on the Size-Ramsey number of long subdivisions of graphs ⋮ Regular pairs in sparse random graphs I ⋮ The size-Ramsey number of trees ⋮ Size Ramsey number of bipartite graphs and bipartite Ramanujan graphs ⋮ A sharp threshold for the Hamilton cycle Maker–Breaker game ⋮ A Ramsey type problem concerning vertex colourings ⋮ On edge‐ordered Ramsey numbers ⋮ On the Size-Ramsey Number of Cycles ⋮ Ordered size Ramsey number of paths ⋮ Bipartite Ramsey numbers involving large \(K_{n,n}\) ⋮ A strengthening of the Erdős-Szekeres theorem ⋮ Remarks on the size Ramsey number of graphs ⋮ New lower bounds on the size-Ramsey number of a path ⋮ Size Ramsey Number of Bounded Degree Graphs for Games ⋮ The size‐Ramsey number of powers of bounded degree trees ⋮ The Size Ramsey Number of Graphs with Bounded Treewidth ⋮ The multicolor size-Ramsey numbers of cycles ⋮ Diameters and Eigenvalues
This page was built for publication: On size Ramsey number of paths, trees, and circuits. I
