Ramsey theory applications.

Rosta, Vera

Displaying similar documents to “Ramsey theory applications.”

Flexible color lists in Alon and Tarsi's theorem, and time scheduling with unreliable participants.

Schauz, Uwe (2010)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Guessing secrets.

Chung, Fan, Graham, Ronald, Leighton, Tom (2001)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Mr. Paint and Mrs. Correct.

Schauz, Uwe (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

$R (3, 4) = 17$ .

Pralat, Pawel (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

A paintability version of the combinatorial Nullstellensatz, and list colorings of $k$ -partite $k$ -uniform hypergraphs.

Schauz, Uwe (2010)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On-line Ramsey theory.

Grytczuk, J.A., Hałuszczak, M., Kierstead, H.A. (2004)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Small Ramsey numbers.

Radziszowski, Stanisław P. (1996)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number

Hajo Broersma, Bert Marchal, Daniel Paulusma, A.N.M. Salman (2009)

Discussiones Mathematicae Graph Theory

Similarity:

We continue the study on backbone colorings, a variation on classical vertex colorings that was introduced at WG2003. Given a graph G = (V,E) and a spanning subgraph H of G (the backbone of G), a λ-backbone coloring for G and H is a proper vertex coloring V→ {1,2,...} of G in which the colors assigned to adjacent vertices in H differ by at least λ. The algorithmic and combinatorial properties of backbone colorings have been studied for various types of backbones in a number of papers....