Results 161 to 170 of about 2,016 (201)
Some of the next articles are maybe not open access.

Independence and graph homomorphisms graph homomorphisms

Journal of Graph Theory, 1993
AbstractA 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

Homomorphism and Dimension

Combinatorics, Probability and Computing, 2005
The dimension of a graph, that is the dimension of its incidence poset, became a major bridge between posets and graphs. Although allowing a nice characterization of planarity, this dimension badly behaves with respect to homomorphisms. We introduce the universal dimension of a graph G as the maximum dimension of a graph having a homomorphism to G. The
Ossona de Mendez, Patrice   +1 more
openaire   +3 more sources

Approximate Homomorphisms II: Group Homomorphisms

Combinatorica, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Approximate Homomorphisms

COMBINATORICA, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Graphs and Homomorphisms

2004
Abstract This is a book about graph homomorphisms, intended to introduce this exciting topic to a wide audience. It attempts to bring together what the authors see as the highlights of the theory and its many applications, and could be read as a sampler of this rich theory, and its most interesting results, techniques, and ...
Pavol Hell, Jaroslav Nesetril
openaire   +1 more source

Homomorphisms and inverse homomorphisms on graph-walking automata

Theoretical Computer Science, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Olga Martynova 0001, Alexander Okhotin
openaire   +2 more sources

Fuzzy homomorphisms

Fuzzy Sets and Systems, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Su-Yun Li   +3 more
openaire   +2 more sources

Homomorphism of Groups

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

Homomorphisms and promotability

1989
The construction of structure-preserving maps, or “homomorphisms,” is described for an arbitrary data type: examples of these functions are given for list- and tree-like structures and types defined by mutual induction. From the definition of a data type it is also possible to infer a “promotion” theorem for proving equalities of homomorphisms.
openaire   +2 more sources

On Lie ideals with derivations as homomorphisms and anti-homomorphisms

Acta Mathematica Hungarica, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Asma, A., Rehman, N., Shakir, A.
openaire   +1 more source

Home - About - Disclaimer - Privacy