AbstractIt is known that the number of colours χ(R3) necessary to colour each point of 3-space so that no two points lying distance 1 apart have the same colour lies between 5 and 21. The upper bound of 21 was established by constructing a colouring with the 1-excluded property. In this paper a 1-excluded, 18-colouring is constructed
X1 colouring of S:The points of any external line to X have different colours. X2 colouring of S:The...
AbstractIt is shown that in every n-colouring ((n − 1)-colouring) of a projective plane (affine plan...
Abstract. This paper studies problems related to visibility among points in the plane. A point x blo...
AbstractIt is known that the number χ(R3) of colours necessary to colour each point of 3-space so th...
It is known that 4 .R2 / 7, where .R2 / is the number of colours necessary to colour each point o...
AbstractThe problem of colouring the real line so that the distance between like coloured numbers do...
summary:What is the least number of colours which can be used to colour all points of the real Eucli...
AbstractThe chromatic number of the plane is the smallest number of colors needed in order to paint ...
Suppose D is a subset of all positive integers Z. The distance graph G(Z; D) is the graph with verte...
We present both probabilistic and constructive lower bounds on the maximum size of a set of points S...
A constrained colouring or, more specifically, an (α, β)-colouring of a hypergraph H, is an assignme...
Is it true that for any coloring of the points of R in two colors there is an ε >0 such that one ...
AbstractLet S be a metric space and let k be a positive integer. Define χ̂(k)(S) to be the smallest ...
Contains fulltext : 197354.pdf (publisher's version ) (Open Access
Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 20...
X1 colouring of S:The points of any external line to X have different colours. X2 colouring of S:The...
AbstractIt is shown that in every n-colouring ((n − 1)-colouring) of a projective plane (affine plan...
Abstract. This paper studies problems related to visibility among points in the plane. A point x blo...
AbstractIt is known that the number χ(R3) of colours necessary to colour each point of 3-space so th...
It is known that 4 .R2 / 7, where .R2 / is the number of colours necessary to colour each point o...
AbstractThe problem of colouring the real line so that the distance between like coloured numbers do...
summary:What is the least number of colours which can be used to colour all points of the real Eucli...
AbstractThe chromatic number of the plane is the smallest number of colors needed in order to paint ...
Suppose D is a subset of all positive integers Z. The distance graph G(Z; D) is the graph with verte...
We present both probabilistic and constructive lower bounds on the maximum size of a set of points S...
A constrained colouring or, more specifically, an (α, β)-colouring of a hypergraph H, is an assignme...
Is it true that for any coloring of the points of R in two colors there is an ε >0 such that one ...
AbstractLet S be a metric space and let k be a positive integer. Define χ̂(k)(S) to be the smallest ...
Contains fulltext : 197354.pdf (publisher's version ) (Open Access
Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 20...
X1 colouring of S:The points of any external line to X have different colours. X2 colouring of S:The...
AbstractIt is shown that in every n-colouring ((n − 1)-colouring) of a projective plane (affine plan...
Abstract. This paper studies problems related to visibility among points in the plane. A point x blo...
DOI
Add to ORKG