Displaying similar documents to “The independence number of dense graphs with large odd girth.”

The cube recurrence.

Carroll, Gabriel D., Speyer, David (2004)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Fruit salad.

Gyárfás, András (1997)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Three-and-more set theorems

Pavol Hell, Jaroslav Nešetřil, André Raspaud, Eric Sopena (2000)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

In this paper we generalize classical 3-set theorem related to stable partitions of arbitrary mappings due to Erdős-de Bruijn, Katětov and Kasteleyn. We consider a structural generalization of this result to partitions preserving sets of inequalities and characterize all finite sets of such inequalities which can be preserved by a “small” coloring. These results are also related to graph homomorphisms and (oriented) colorings.