Page 1

Displaying 1 – 11 of 11

Showing per page

Rainbow numbers for small stars with one edge added

Izolda Gorgol, Ewa Łazuka (2010)

Discussiones Mathematicae Graph Theory

A subgraph of an edge-colored graph is rainbow if all of its edges have different colors. For a graph H and a positive integer n, the anti-Ramsey number f(n,H) is the maximum number of colors in an edge-coloring of Kₙ with no rainbow copy of H. The rainbow number rb(n,H) is the minimum number of colors such that any edge-coloring of Kₙ with rb(n,H) number of colors contains a rainbow copy of H. Certainly rb(n,H) = f(n,H) + 1. Anti-Ramsey numbers were introduced by Erdös et al. [5] and studied in...

Ramsey numbers for trees II

Zhi-Hong Sun (2021)

Czechoslovak Mathematical Journal

Let r ( G 1 , G 2 ) be the Ramsey number of the two graphs G 1 and G 2 . For n 1 n 2 1 let S ( n 1 , n 2 ) be the double star given by V ( S ( n 1 , n 2 ) ) = { v 0 , v 1 , ... , v n 1 , w 0 , w 1 , ... , w n 2 } and E ( S ( n 1 , n 2 ) ) = { v 0 v 1 , ... , v 0 v n 1 , v 0 w 0 , w 0 w 1 , ... , w 0 w n 2 } . We determine r ( K 1 , m - 1 , S ( n 1 , ...

Ramsey-type theorems

Gavalec, Martin, Vojtáš, Peter (1980)

Abstracta. 8th Winter School on Abstract Analysis

Remarks on 15-vertex (3,3)-ramsey graphs not containing K₅

Sebastian Urbański (1996)

Discussiones Mathematicae Graph Theory

The paper gives an account of previous and recent attempts to determine the order of a smallest graph not containing K₅ and such that every 2-coloring of its edges results in a monochromatic triangle. A new 14-vertex K₄-free graph with the same Ramsey property in the vertex coloring case is found. This yields a new construction of one of the only two known 15-vertex (3,3)-Ramsey graphs not containing K₅.

Currently displaying 1 – 11 of 11

Page 1