In this chapter we set out from a type of problem which, on the face of it, appears to be similar to the theme of Chapter 7: what kind of substructures are necessarily present in every large enough graph? While ‘large’ in Chapter 7 meant ‘many edges’ on a given number of vertices, in this chapter it will simply mean ‘many vertices’.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Ramsey Theory for Graphs

  • Reinhard Diestel

摘要

In this chapter we set out from a type of problem which, on the face of it, appears to be similar to the theme of Chapter 7: what kind of substructures are necessarily present in every large enough graph? While ‘large’ in Chapter 7 meant ‘many edges’ on a given number of vertices, in this chapter it will simply mean ‘many vertices’.