702 research outputs found
Homomorphisms of binary Cayley graphs
A binary Cayley graph is a Cayley graph based on a binary group. In 1982,
Payan proved that any non-bipartite binary Cayley graph must contain a
generalized Mycielski graph of an odd-cycle, implying that such a graph cannot
have chromatic number 3. We strengthen this result first by proving that any
non-bipartite binary Cayley graph must contain a projective cube as a subgraph.
We further conjecture that any homo- morphism of a non-bipartite binary Cayley
graph to a projective cube must be surjective and we prove some special case of
this conjecture
Caterpillar dualities and regular languages
We characterize obstruction sets in caterpillar dualities in terms of regular
languages, and give a construction of the dual of a regular family of
caterpillars. We show that these duals correspond to the constraint
satisfaction problems definable by a monadic linear Datalog program with at
most one EDB per rule
ABC : l’alphabétisation de l’esprit populaire de Ivan ILLICH et Barry SANDERS, Paris, La Découverte, Montréal, Boréal, 1990, 163 p.
Density via duality
AbstractWe present an unexpected correspondence between homomorphism duality theorems and gaps in the poset of graphs and their homomorphisms. This gives a new proof of the density theorem for undirected graphs and solves the density problem for directed graphs
Adjoint functors and tree duality
A family T of digraphs is a complete set of obstructions for a digraph H if
for an arbitrary digraph G the existence of a homomorphism from G to H is
equivalent to the non-existence of a homomorphism from any member of T to G. A
digraph H is said to have tree duality if there exists a complete set of
obstructions T consisting of orientations of trees. We show that if H has tree
duality, then its arc graph delta H also has tree duality, and we derive a
family of tree obstructions for delta H from the obstructions for H.
Furthermore we generalise our result to right adjoint functors on categories
of relational structures. We show that these functors always preserve tree
duality, as well as polynomial CSPs and the existence of near-unanimity
functions.Comment: 14 pages, 2 figures; v2: minor revision
- …