On Homomorphism Graphs

by   Sebastian Brandt, et al.
National University of Singapore
ETH Zurich
California Institute of Technology
University of Warwick

We introduce a new type of examples of bounded degree acyclic Borel graphs and study their combinatorial properties in the context of descriptive combinatorics, using a generalization of the determinacy method of Marks. The motivation for the construction comes from the adaptation of this method to the LOCAL model of distributed computing. Our approach unifies the previous results in the area, as well as produces new ones. In particular, we show that for Δ>2 it is impossible to give a simple characterization of acyclic Δ-regular Borel graphs with Borel chromatic number at most Δ: such graphs form a Σ^1_2-complete set. This implies a strong failure of Brooks'-like theorems in the Borel context.


page 1

page 2

page 3

page 4


Complexity of acyclic colorings of graphs and digraphs with degree and girth constraints

We consider acyclic r-colorings in graphs and digraphs: they color the v...

Heroes in oriented complete multipartite graphs

The dichromatic number of a digraph is the minimum size of a partition o...

Combinatorial generation via permutation languages. V. Acyclic orientations

In 1993, Savage, Squire, and West described an inductive construction fo...

Computing SEQ-IC-LCS of Labeled Graphs

We consider labeled directed graphs where each vertex is labeled with a ...

LAYERWIDTH: Analysis of a New Metric for Directed Acyclic Graphs

We analyze a new property of directed acyclic graphs (DAGs), called laye...

United Monoids: Finding Simplicial Sets and Labelled Algebraic Graphs in Trees

Graphs and various graph-like combinatorial structures, such as preorder...

Truth and Knowledge

The main subjects of this text are: (1) Generalization of concepts and...

Please sign up or login with your details

Forgot password? Click here to reset