The size-Ramsey number of powers of bounded degree trees

MaRDI QIDQ6621160FDOQ6621160

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)

Cites Work

• Expanding graphs contain all small trees
• On the combinatorial problems which I would most like to see solved
• The size Ramsey number
• On size Ramsey number of paths, trees, and circuits. I
• The Induced Size-Ramsey Number of Cycles
• An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths
• The size-Ramsey number of trees
• On size Ramsey numbers of graphs with bounded degree
• Sparse partition universal graphs for graphs of bounded degree
• Explicit construction of linear sized tolerant networks
• Title not available (Why is that?)
• The size-Ramsey number of trees
• The size Ramsey number of trees with bounded degree
• Path Ramsey Number for Random Graphs
• On some Multicolor Ramsey Properties of Random Graphs
• The size‐Ramsey number of powers of paths
• The size Ramsey number of short subdivisions of bounded degree graphs

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)