On two problems in graph Ramsey theory
β Scribed by David Conlon, Jacob Fox, Benny Sudakov
- Book ID
- 118786695
- Publisher
- Springer-Verlag
- Year
- 2012
- Tongue
- English
- Weight
- 299 KB
- Volume
- 32
- Category
- Article
- ISSN
- 0209-9683
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
For given finite (unordered) graphs \(G\) and \(H\), we examine the existence of a Ramsey graph \(F\) for which the strong Ramsey arrow \(F \rightarrow(G)_{r}^{\prime \prime}\) holds. We concentrate on the situation when \(H\) is not a complete graph. The set of graphs \(G\) for which there exists a
Given i, j positive integers, let K denote a bipartite complete graph and let i, j ## Ε½ . R m, n be the smallest integer a such that for any r-coloring of the edges of K r a, a one can always find a monochromatic subgraph isomorphic to K . In other m, n Ε½ . Γ 4 words, if a G R m, n then every mat
## Abstract The aim of this note is to give an account of some recent results and state a number of conjectures concerning extremal properties of graphs.