7 research outputs found
Interleaved adjoints on directed graphs
For an integer k >= 1, the k-th interlacing adjoint of a digraph G is the
digraph i_k(G) with vertex-set V(G)^k, and arcs ((u_1, ..., u_k), (v_1, ...,
v_k)) such that (u_i,v_i) \in A(G) for i = 1, ..., k and (v_i, u_{i+1}) \in
A(G) for i = 1, ..., k-1. For every k we derive upper and lower bounds for the
chromatic number of i_k(G) in terms of that of G. In particular, we find tight
bounds on the chromatic number of interlacing adjoints of transitive
tournaments. We use this result in conjunction with categorial properties of
adjoint functors to derive the following consequence. For every integer ell,
there exists a directed path Q_{\ell} of algebraic length ell which admits
homomorphisms into every directed graph of chromatic number at least 4. We
discuss a possible impact of this approach on the multifactor version of the
weak Hedetniemi conjecture
Linear Datalog and Bounded Path Duality of Relational Structures
In this paper we systematically investigate the connections between logics
with a finite number of variables, structures of bounded pathwidth, and linear
Datalog Programs. We prove that, in the context of Constraint Satisfaction
Problems, all these concepts correspond to different mathematical embodiments
of a unique robust notion that we call bounded path duality. We also study the
computational complexity implications of the notion of bounded path duality. We
show that every constraint satisfaction problem \csp(\best) with bounded path
duality is solvable in NL and that this notion explains in a uniform way all
families of CSPs known to be in NL. Finally, we use the results developed in
the paper to identify new problems in NL
Hereditarily hard H-colouring problems
AbstractLet H be a graph (respectively digraph) whose vertices are called ‘colours’. An H-colouring of a graph (respectively digraph) G is an assignment of these colours to the vertices of G so that if u is adjacent to v in G, then the colour of u is adjacent to the colour of v in H. We continue the study of the complexity of the H-colouring problem ‘Does a given graph (respectively digraph) admit an H-colouring?’. For graphs it was proved that the H-colouring problem is NP-complete whenever H contains an odd cycle, and is polynomial for bipartite graphs. For directed graphs the situation is quite different, as the addition of an edge to H can result in the complexity of the H-colouring problem shifting from NP-complete to polynomial. In fact, there is not even a plausible conjecture as to what makes directed H-colouring problems difficult in general. Some order may perhaps be found for those digraphs H in which each vertex has positive in-degree and positive out-degree. In any event, there is at least, in this case, a conjecture of a classification by complexity of these directed H-colouring problems. Another way, which we propose here, to bring some order to the situation is to restrict our attention to those digraphs H which, like odd cycles in the case of graphs, are hereditarily hard, i.e., are such that the H′-colouring problem is NP-hard for any digraph H′ containing H as a subdigraph. After establishing some properties of the digraphs in this class, we make a conjecture as to precisely which digraphs are hereditarily hard. Surprisingly, this conjecture turns out to be equivalent to the one mentioned earlier. We describe several infinite families of hereditarily hard digraphs, and identify a family of digraphs which are minimal in the sense that it would be sufficient to verify the conjecture for members of that family
Universal intervals in the homomorphism order of digraphs
In this thesis we solve some open problems related to the homomorphism order of digraphs. We begin by introducing the basic concepts of graphs and homomorphisms and studying some properties of the homomorphism order of digraphs. Then we present the new results. First, we show that the class of digraphs containing cycles has the fractal property (strengthening the density property) . Then we show a density theorem for the class of proper oriented trees. Here we say that a tree is proper if it is not a path. Such result was claimed in 2005 but none proof have been published ever since. We also show that the class of proper oriented trees, in addition to be dense, has the fractal property. We end by considering the consequences of these results and the remaining open questions in this area.Outgoin
Characterizing universal intervals in the homomorphism order of digraphs
In this thesis we characterize all intervals in the homomorphism order of digraphs in terms of universality. To do this, we first show that every interval of the class of digraphs containing cycles is universal. Then we focus our interest in the class of oriented trees (digraphs with no cycles). We give a density theorem for the class of oriented paths and a density theorem for the class of oriented trees, and we strengthen these results by characterizing all universal intervals in these classes. We conclude by summarising all statements and characterizing the universal intervals in the class of digraphs. This solves an open problem in the area