DeepAI AI Chat
Log In Sign Up

Constructible Graphs and Pursuit

by   Maria-Romina Ivan, et al.
University of Cambridge
Queen Mary University of London

A (finite or infinite) graph is called constructible if it may be obtained recursively from the one-point graph by repeatedly adding dominated vertices. In the finite case, the constructible graphs are precisely the cop-win graphs, but for infinite graphs the situation is not well understood. One of our aims in this paper is to give a graph that is cop-win but not constructible. This is the first known such example. We also show that every countable ordinal arises as the rank of some constructible graph, answering a question of Evron, Solomon and Stahl. In addition, we give a finite constructible graph for which there is no construction order whose associated domination map is a homomorphism, answering a question of Chastand, Laviolette and Polat. Lehner showed that every constructible graph is a weak cop win (meaning that the cop can eventually force the robber out of any finite set). Our other main aim is to investigate how this notion relates to the notion of `locally constructible' (every finite graph is contained in a finite constructible subgraph). We show that, under mild extra conditions, every locally constructible graph is a weak cop win. But we also give an example to show that, in general, a locally constructible graph need not be a weak cop win. Surprisingly, this graph may even be chosen to be locally finite. We also give some open problems.


A Constructive Formalization of the Weak Perfect Graph Theorem

The Perfect Graph Theorems are important results in graph theory describ...

Beyond symmetry in generalized Petersen graphs

A graph is a core or unretractive if all its endomorphisms are automorph...

X-Ramanujan Graphs

Let X be an infinite graph of bounded degree; e.g., the Cayley graph of ...

A notion of continuity in discrete spaces and applications

We propose a notion of continuous path for locally finite metric spaces,...

Planarity is (almost) locally checkable in constant-time

Locally checkable proofs for graph properties were introduced by Göös an...

The Minrank of Random Graphs over Arbitrary Fields

The minrank of a graph G on the set of vertices [n] over a field F is th...

Verification Tools for Checking some kinds of Testability

A locally testable language L is a language with the property that for s...