A bound for size Ramsey numbers of multipartite graphs.

Sun, Yuqin; Li, Yusheng

Displaying similar documents to “A bound for size Ramsey numbers of multipartite graphs.”

Edit distance and its computation.

Balogh, József, Martin, Ryan (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Acyclic, star and oriented colourings of graph subdivisions.

Wood, David R. (2005)

Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]

Similarity:

Extremal problems for $t$ -partite and $t$ -colorable hypergraphs.

Mubayi, Dhruv, Talbot, John (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Generalizing the Ramsey problem through diameter.

Mubayi, Dhruv (2002)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On 1-dependent ramsey numbers for graphs

E.J. Cockayne, C.M. Mynhardt (1999)

Discussiones Mathematicae Graph Theory

Similarity:

A set X of vertices of a graph G is said to be 1-dependent if the subgraph of G induced by X has maximum degree one. The 1-dependent Ramsey number t₁(l,m) is the smallest integer n such that for any 2-edge colouring (R,B) of Kₙ, the spanning subgraph B of Kₙ has a 1-dependent set of size l or the subgraph R has a 1-dependent set of size m. The 2-edge colouring (R,B) is a t₁(l,m) Ramsey colouring of Kₙ if B (R, respectively) does not contain a 1-dependent set of size l (m, respectively);...