Homomorphism-homogeneous Graphs with Loops
نویسندگان
چکیده
In 2006, P. J. Cameron and J. Nešetřil introduced the following variant of homogeneity: we say that a structure is homomorphismhomogeneous if every homomorphism between finite substructures of the structure extends to an endomorphism of the structure. In this paper we classify finite homomorphism-homogeneous graphs where some vertices may have loops, but only up to a certain point. We focus on disconnected graphs, and on connected graphs whose subgraph induced by loops is disconnected. In a way, this is the best one can hope for, since it was shown in a recent paper by M. Rusinov and P. Schweitzer that there is no polynomially computable characterization of finite homomorphism-homogeneous graphs whose subgraph induced by loops is connected (unless P = coNP). AMS Mathematics Subject Classification (2010): 05C75
منابع مشابه
Homomorphism-homogeneous graphs
We answer two open questions posed by Cameron and Nesetril concerning homomorphismhomogeneous graphs. In particular we show, by giving a characterization of these graphs, that extendability to monomorphism or to homomorphism leads to the same class of graphs when defining homomorphism-homogeneity. Further we show that there are homomorphism-homogeneous graphs that do not contain the Rado graph ...
متن کاملComplexity of locally-injective homomorphisms to tournaments
Given two graphs G = (VG, EG) and H = (VH , EH), a homomorphism from G to H is a function f : VG → VH such that for every uv ∈ EG, f(u)f(v) ∈ EH . A homomorphism from G to H is referred to as an H-colouring of G and the vertices of H are regarded as colours. The graph H is called the target of the homomorphism. These definitions extend to directed graphs by requiring that the mapping must prese...
متن کاملMinimum Cost Homomorphism to Oriented Cycles with Some Loops
For digraphs D and H, a homomorphism of D to H is a mapping f : V (D)→V (H) such that uv ∈ A(D) implies f(u)f(v) ∈ A(H). Suppose D and H are two digraphs, and ci(u), u ∈ V (D), i ∈ V (H), are nonnegative real costs. The cost of the homomorphism f of D to H is ∑ u∈V (D) cf(u)(u). The minimum cost homomorphism for a fixed digraph H, denoted by MinHOM(H), asks whether or not an input digraphD, wit...
متن کاملColoring Graphs with Graphs: a Survey
Many problems in and areas of graph theory can be thought of in terms of graph homomorphisms. For graphs G and H, a homomorphism from G to H is a function φ : V (G)→ V (H) such that if xy ∈ E(G) then φ(x)φ(y) ∈ E(H). (See [1] for a comprehensive introduction.) Let Hom(G,H) be the set of homomorphisms from G to H. In this survey, we will be interested in counting homomorphisms from G to H and so...
متن کاملFinite Homomorphism-Homogeneous Permutations via Edge Colourings of Chains
A relational structure is homomorphism-homogeneous if any homomorphism between its finite substructures extends to an endomorphism of the structure in question. In this note, we characterise all permutations on a finite set enjoying this property. To accomplish this, we switch from the more traditional view of a permutation as a set endowed with two linear orders to a different representation b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012