Search Results - "Sauer, N.W."
-
1
Vertex partitions of metric spaces with finite distance sets
Published in Discrete mathematics (06-01-2012)“…A metric space M=(M,d) is indivisible if for every colouring χ:M→2 there exists i∈2 and a copy N=(N,d) of M in M so that χ(x)=i for all x∈N. The metric space M…”
Get full text
Journal Article -
2
Some weak indivisibility results in ultrahomogeneous metric spaces
Published in European journal of combinatorics (01-07-2010)“…We study the validity of a partition property known as weak indivisibility for the integer and the rational Urysohn metric spaces. We also compare weak…”
Get full text
Journal Article -
3
Chromatic numbers and products
Published in Discrete mathematics (06-09-2005)“…Let f ( n ) be the smallest number so that there are two n chromatic graphs whose product has chromatic number f ( n ) . Under the assumption that a certain…”
Get full text
Journal Article -
4
A Ramsey theorem for countable homogeneous directed graphs
Published in Discrete mathematics (06-06-2002)“…Let T be a finite set of finite tournaments and H T the countable homogeneous directed graph which does not embed any of the tournaments in T . We will…”
Get full text
Journal Article -
5
Indivisible homogeneous directed graphs and a game for vertex partitions
Published in Discrete mathematics (06-03-2005)“…Let T be a set of finite tournaments. We will give a necessary and sufficient condition for the T -free homogeneous directed graph H T to be divisible; that…”
Get full text
Journal Article