Results 151 to 160 of about 125,880 (198)
Some of the next articles are maybe not open access.
Approximate Homomorphisms II: Group Homomorphisms
Combinatorica, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
COMBINATORICA, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Polynomially dependent homomorphisms and frobenius n-homomorphisms
Proceedings of the Steklov Institute of Mathematics, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Independence and graph homomorphisms graph homomorphisms
Journal of Graph Theory, 1993AbstractA graph with n vertices that contains no triangle and no 5‐cycle and minimum degree exceeding n/4 contains an independent set with at least (3n)/7 vertices. This is best possible. The proof proceeds by producing a homomorphism to the 7‐cycle and invoking the No Homomorphism Lemma.
Michael O. Albertson +2 more
openaire +1 more source
The Annals of Mathematics, 1941
=, + G2 + * *= En Gp, I H = H1+ H2 + * = ZHP Gp Gq = Ox Hp Hq = O (p 5 iq) where the notation is not to be taken to mean that the sets are denumerable; the elements of a set Gp will be denoted by gp, gp, .. . . Then G is said to be homomorphic to H, G H, if (1) gpgq =gr D HpHq _ Hr.
openaire +2 more sources
=, + G2 + * *= En Gp, I H = H1+ H2 + * = ZHP Gp Gq = Ox Hp Hq = O (p 5 iq) where the notation is not to be taken to mean that the sets are denumerable; the elements of a set Gp will be denoted by gp, gp, .. . . Then G is said to be homomorphic to H, G H, if (1) gpgq =gr D HpHq _ Hr.
openaire +2 more sources
Reversible data hiding in encrypted images with additive and multiplicative public-key homomorphism
Signal Processing, 2019Bing Chen, Xiaotian Wu, Wei Lu
exaly

