What conditions ensure that a graph G contains some given spanning subgraph H? The
most famous examples of results of this kind are probably Dirac's theorem on Hamilton …

The size-Ramsey number RF of a graph F is the smallest integer m such that there exists a
graph G on m edges with the property that any coloring of the edges of G with two colors …

Improving a result of Erdős, Gyárfás and Pyber for large n we show that for every integer r⩾
2 there exists a constant n0= n0 (r) such that if n⩾ n0 and the edges of the complete graph …

For any sequence of positive integers j1< j2<···< jn, the k‐tuples (ji, ji+ 1,…, ji+ k− 1), i= 1,
2,…, n− k+ 1, are said to form a monotone path of length n. Given any integers n⩾ k⩾ 2 and …

The Ramsey number for a triple of long even cycles Page 1 Journal of Combinatorial Theory,
Series B 97 (2007) 584–596 www.elsevier.com/locate/jctb The Ramsey number for a triple of …

Tree Containment and Degree Conditions | SpringerLink Skip to main content
Advertisement Springer Nature Link Account Menu Find a journal Publish with us Track …

The‐color bipartite Ramsey number of a bipartite graph is the least integer for which every‐
edge‐colored complete bipartite graph contains a monochromatic copy of. The study of …

Color‐biased Hamilton cycles in random graphs - Gishboliner - 2022 - Random Structures &
Algorithms - Wiley Online Library Skip to Article Content Skip to Article Information Wiley Online …

For a graph G, the k-colour Ramsey number R k (G) is the least integer N such that every k-
colouring of the edges of the complete graph KN contains a monochromatic copy of G. Let C …

Denote by R (L, L, L) the minimum integer N such that any 3-coloring of the edges of the
complete graph on N vertices contains a monochromatic copy of a graph L. Bondy and …