Article contents
A note on the Size-Ramsey number of long subdivisions of graphs
Published online by Cambridge University Press: 15 March 2005
Abstract
Let TsH be the graph obtained from a given graph H by subdividing each edge s times. Motivated by a problem raised by Igor Pak [Mixing time and long paths in graphs, in Proc. of the 13th annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002) 321–328], we prove that, for any graph H, there exist graphs G with O(s) edges that are Ramsey with respect to TsH.
- Type
- Research Article
- Information
- RAIRO - Theoretical Informatics and Applications , Volume 39 , Issue 1: Imre Simon, the tropical computer scientist , January 2005 , pp. 191 - 206
- Copyright
- © EDP Sciences, 2005
References
- 7
- Cited by