Previous Page 2

Displaying 21 – 25 of 25

Showing per page

The Quest for A Characterization of Hom-Properties of Finite Character

Izak Broere, Moroli D.V. Matsoha, Johannes Heidema (2016)

Discussiones Mathematicae Graph Theory

A graph property is a set of (countable) graphs. A homomorphism from a graph G to a graph H is an edge-preserving map from the vertex set of G into the vertex set of H; if such a map exists, we write G → H. Given any graph H, the hom-property →H is the set of H-colourable graphs, i.e., the set of all graphs G satisfying G → H. A graph property P is of finite character if, whenever we have that F ∈ P for every finite induced subgraph F of a graph G, then we have that G ∈ P too. We explore some of...

Travel groupoids on infinite graphs

Jung Rae Cho, Jeongmi Park, Yoshio Sano (2014)

Czechoslovak Mathematical Journal

The notion of travel groupoids was introduced by L. Nebeský in 2006 in connection with a study on geodetic graphs. A travel groupoid is a pair of a set V and a binary operation * on V satisfying two axioms. We can associate a graph with a travel groupoid. We say that a graph G has a travel groupoid if the graph associated with the travel groupoid is equal to G . Nebeský gave a characterization of finite graphs having a travel groupoid. In this paper, we study travel groupoids on infinite graphs....

Universality for and in Induced-Hereditary Graph Properties

Izak Broere, Johannes Heidema (2013)

Discussiones Mathematicae Graph Theory

The well-known Rado graph R is universal in the set of all countable graphs I, since every countable graph is an induced subgraph of R. We study universality in I and, using R, show the existence of 2 א0 pairwise non-isomorphic graphs which are universal in I and denumerably many other universal graphs in I with prescribed attributes. Then we contrast universality for and universality in induced-hereditary properties of graphs and show that the overwhelming majority of induced-hereditary properties...

Universality in Graph Properties with Degree Restrictions

Izak Broere, Johannes Heidema, Peter Mihók (2013)

Discussiones Mathematicae Graph Theory

Rado constructed a (simple) denumerable graph R with the positive integers as vertex set with the following edges: For given m and n with m < n, m is adjacent to n if n has a 1 in the m’th position of its binary expansion. It is well known that R is a universal graph in the set [...] of all countable graphs (since every graph in [...] is isomorphic to an induced subgraph of R). A brief overview of known universality results for some induced-hereditary subsets of [...] is provided. We then construct...

Currently displaying 21 – 25 of 25

Previous Page 2