A category $mathbf{C}$ is called Cartesian closed  provided that it has finite products and for each$mathbf{C}$-object $A$ the functor $(Atimes -): Ara A$ has a right adjoint. It is well known that the category $mathbf{TopFuzz}$  of all topological fuzzes is both complete  and cocomplete, but it is not Cartesian closed. In this paper, we introduce some Cartesian closed subcategories of this cat...

A graph G is 1-homogeneous if certain isomorphisms between similarly embedded induced subgraphs of G extend to automorphisms of G. We show that the only connected composite 1-homogeneous graphs are the cube, and Kn ×K2 and Kn ×Kn with n ≥ 2.

This note is an illustration of the density-increment method used in the proof of the density Hales-Jewett theorem for k = 3. (Polymath project [2]) I will repeat the argument applying it to a problem which is easier than DHJ. In the last section I will describe the proof of the density Hales-Jewett theorem for k = 3. The results stated here are direct interpretations of the project’s results, ...

A set of vertices $S$ in a connected graph $G$ is a different-distance set if, for any vertex $w$ outside $S$, no two vertices in $S$ have the same distance to $w$.The lower and upper different-distance number of a graph are the order of a smallest, respectively largest, maximal different-distance set.We prove that a different-distance set induces either a special type of path or an independent...