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

DOI10.1002/JGT.3190070115zbMATH Open0508.05047OpenAlexW4241497605WikidataQ105583217 ScholiaQ105583217MaRDI QIDQ4745847FDOQ4745847

Authors: 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

monochromatic copysize Ramsey numbertwo-coloring

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Generalized Ramsey theory (05C55)

Cited In (72)

• Rolling backwards can move you forward: on embedding problems in sparse expanders
• The asymptotic of off-diagonal online Ramsey numbers for paths
• Short proofs for long induced paths
• The size-Ramsey number of powers of bounded degree trees
• On the size-Ramsey number of grids
• On the restricted size Ramsey number for a pair of cycles
• Off-diagonal online size Ramsey numbers for paths
• On the size-Ramsey number of grid graphs
• Size Gallai-Ramsey number
• Ramsey goodness of clique versus paths in random graphs
• The size‐Ramsey number of cubic graphs
• On the size-Ramsey number of tight paths
• The vertex size-Ramsey number
• Degree Ramsey numbers of graphs
• The size Ramsey number of a directed path
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Diameters and Eigenvalues
• Sparse partition universal graphs for graphs of bounded degree
• Path Ramsey number for random graphs
• Monochromatic paths in random tournaments
• The size-Ramsey number of trees
• Graph theory. Abstracts from the workshop held January 2--8, 2022
• Remarks on a paper by H. Bielak on size Ramsey numbers
• Degree Ramsey numbers for even cycles
• Packing nearly optimal Ramsey \(R(3,t)\) graphs
• An analogue of the Erdős-Gallai theorem for random graphs
• Degree bipartite Ramsey numbers
• The size‐Ramsey number of short subdivisions
• Expanding graphs contain all small trees
• Size Ramsey number of bipartite graphs and bipartite Ramanujan graphs
• A Ramsey type problem concerning vertex colourings
• On the minimum degree of minimal Ramsey graphs for multiple colours
• Remarks on the size Ramsey number of graphs
• The size-Ramsey number of powers of bounded degree trees
• On the size-Ramsey number of cycles
• On the Ramsey number \(r(H+\overline{K_ n},K_ n)\)
• A note on lower bounds for induced Ramsey numbers
• On some multicolor Ramsey properties of random graphs
• Explicit construction of linear sized tolerant networks
• The size Ramsey number of short subdivisions of bounded degree graphs
• The size-Ramsey number of trees
• Regular pairs in sparse random graphs I
• An alternative proof of the linearity of the size-Ramsey number of paths
• Size Ramsey numbers for some regular graphs
• Size Ramsey numbers for some regular graphs
• Online Ramsey theory for planar graphs
• Local \(k\)-colorings of graphs and hypergraphs
• On the discrepancies of graphs
• A strengthening of the Erdős-Szekeres theorem
• Bipartite Ramsey numbers involving large \(K_{n,n}\)
• Note on the multicolour size-Ramsey number for paths
• On edge-ordered Ramsey numbers
• Large generalized books are \(p\)-good
• A note on the Size-Ramsey number of long subdivisions of graphs
• The multicolor size-Ramsey numbers of cycles
• The size-Ramsey number of 3-uniform tight paths
• On-line Ramsey numbers of paths and cycles
• Size Ramsey number of bounded degree graphs for games
• The Size Ramsey Number of Graphs with Bounded Treewidth
• The multicolour size-Ramsey number of powers of paths
• On-line size Ramsey number for monotone \(k\)-uniform ordered paths with uniform looseness
• New lower bounds on the size-Ramsey number of a path
• Ordered size Ramsey number of paths
• Size-Ramsey numbers of cycles versus a path
• Almost-spanning universality in random graphs
• The size Ramsey number of trees with bounded degree
• The oriented size Ramsey number of directed paths
• A sharp threshold for the Hamilton cycle Maker–Breaker game
• On an anti‐Ramsey property of Ramanujan graphs
• The structure of transform graphs
• Explicit construction of linear sized tolerant networks. (Reprint)
• The Induced Size-Ramsey Number of Cycles

This page was built for publication: On size Ramsey number of paths, trees, and circuits. I

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4745847)