The size‐Ramsey number of trees

DOI10.1002/rsa.20363zbMath1236.05128OpenAlexW2067630633WikidataQ105583212 ScholiaQ105583212MaRDI QIDQ5894526

Domingos jun. Dellamonica

Publication date: 7 March 2012

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20363

zbMATH Keywords

treesexpander graphssize-Ramsey number

Mathematics Subject Classification ID

Trees (05C05) Generalized Ramsey theory (05C55)

Related Items (8)

The vertex size-Ramsey number ⋮ Degree Ramsey numbers for even cycles ⋮ The size‐Ramsey number of short subdivisions ⋮ The multicolour size-Ramsey number of powers of paths ⋮ The size Ramsey number of short subdivisions of bounded degree graphs ⋮ Lower bounds of size Ramsey number for graphs with small independence number ⋮ The size‐Ramsey number of powers of bounded degree trees ⋮ The Size Ramsey Number of Graphs with Bounded Treewidth

Cites Work

• Unnamed Item
• Unnamed Item
• Expanding graphs contain all small trees
• The size Ramsey number
• The size Ramsey number of trees with bounded degree
• On size Ramsey number of paths, trees, and circuits. I
• Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
• The size-Ramsey number of trees
• On size Ramsey numbers of graphs with bounded degree

This page was built for publication: The size‐Ramsey number of trees