Displaying similar documents to “On a variant of van der Waerden's theorem.”

The Incidence Chromatic Number of Toroidal Grids

Éric Sopena, Jiaojiao Wu (2013)

Discussiones Mathematicae Graph Theory

Similarity:

An incidence in a graph G is a pair (v, e) with v ∈ V (G) and e ∈ E(G), such that v and e are incident. Two incidences (v, e) and (w, f) are adjacent if v = w, or e = f, or the edge vw equals e or f. The incidence chromatic number of G is the smallest k for which there exists a mapping from the set of incidences of G to a set of k colors that assigns distinct colors to adjacent incidences. In this paper, we prove that the incidence chromatic number of the toroidal grid Tm,n = Cm2Cn equals...

Invariance in the class of weighted quasi-arithmetic means

Justyna Jarczyk, Janusz Matkowski (2006)

Annales Polonici Mathematici

Similarity:

Under the assumption of twice continuous differentiability of some of the functions involved we determine all the weighted quasi-arithmetic means M,N,K such that K is (M,N)-invariant, that is, K∘(M,N) = K. Some applications to iteration theory and functional equations are presented.