The size-Ramsey number of powers of bounded degree trees

MaRDI QIDQ6621160zbMATH OpenFDO

Authors Sören Berger, Yoshiharu Kohayakawa, Giulia S. Maesaka, Taísa L. Martins, Walner Mendonça, G. O. Mota, O. Parczyk

Publication date 18 October 2024

Published in Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Recommendations

• The size-Ramsey number of powers of bounded degree trees
• The multicolour size-Ramsey number of powers of paths
• The size Ramsey number of trees with bounded degree
• The size-Ramsey number of trees
• The size‐Ramsey number of powers of paths

Cites work

• scientific article; zbMATH DE number 3961650 (Why is no real title available?)
• An alternative proof of the linearity of the size-Ramsey number of paths
• Expanding graphs contain all small trees
• Explicit construction of linear sized tolerant networks
• On size Ramsey number of paths, trees, and circuits. I
• On size Ramsey numbers of graphs with bounded degree
• On some multicolor Ramsey properties of random graphs
• On the combinatorial problems which I would most like to see solved
• Path Ramsey number for random graphs
• Sparse partition universal graphs for graphs of bounded degree
• The Induced Size-Ramsey Number of Cycles
• The size Ramsey number
• The size Ramsey number of short subdivisions of bounded degree graphs
• The size Ramsey number of trees with bounded degree
• The size-Ramsey number of trees
• The size-Ramsey number of trees
• The size‐Ramsey number of powers of paths

This page was built for publication: The size-Ramsey number of powers of bounded degree trees

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