Related papers: Triangles and Vitali sets
Let P be the direct product of countably many copies of the additive group Z of integers. We study, from a set-theoretic point of view, those subgroups of P for which all homomorphisms to Z annihilate all but finitely many of the standard…
We study two parameters obtained from the Euler characteristic by replacing the number of faces with that of induced and induced non-separating cycles. By establishing monotonicity of such parameters under certain homomorphism and edge…
We develop the theory of cofinal types of ultrafilters over measurable cardinals and establish its connections to Galvin's property. We generalize fundamental results from the countable to the uncountable, but often in surprisingly…
Beginning with the concepts of orientation for a 3-hypergraph and transitivity for an oriented 3-hypergraph, it is natural to study the class of comparability 3-hypergraphs (those that can be transitively oriented). In this work we show…
There is a famous problem in geometric graph theory to find the chromatic number of the unit distance graph on Euclidean space; it remains unsolved. A theorem of Erdos and De-Bruijn simplifies this problem to finding the maximum chromatic…
We give a characterization of finite sets of triples of elements (e.g., positive integers) that can be colored with two colors such that for every element $i$ in each color class there exists a triple which does not contain $i$. We give a…
We prove two ZFC theorems about cardinal invariants above the continuum which are in sharp contrast to well-known facts about these same invariants at the continuum. It is shown that for an uncountable regular cardinal $\kappa$,…
We seek conditions under which colorings of various vector spaces are guaranteed to have a copy of a unit equilateral triangle, having each vertex in a different color class. In particular, we explore the analogous question in the setting…
For every integer $r\ge3$ and every $\eps>0$ we construct a graph with maximum degree $r-1$ whose circular total chromatic number is in the interval $(r,r+\eps)$. This proves that (i) every integer $r\ge3$ is an accumulation point of the…
Chromogeometry brings together Euclidean geometry (called blue) and two relativistic geometries (called red and green), in a surprising three-fold symmetry. We show how the red and green `Euler lines' and `nine-point circles' of a triangle…
We prove that for any partition of the plane into a closed set $C$ and an open set $O$ and for any configuration $T$ of three points, there is a translated and rotated copy of $T$ contained in $C$ or in $O$. Apart from that, we consider…
Chromatic maps for spherical tensor categories are instrumental tools to construct (non semisimple) invariants of 3-manifolds and their extension to (non compact) (2+1)-TQFTs. In this paper, we introduce left and right chromatic maps for…
It is shown that the consistency strength of ZF + DC + "the closed unbounded ultrafilter on omega_1 is an ultrafilter" is exactly ZFC + one measurable cardinal.
Elementary graphs are graphs whose edges can be colored using two colors in such a way that the edges in any induced $P_3$ get distinct colors. They constitute a subclass of the class of claw-free perfect graphs. In this paper, we show that…
Similar to Euclidean geometry, graph theory is a science that studies figures that consist of points and lines. The core of Euclidean geometry is the parallel postulate, which provides the basis of the geometric invariant that the sum of…
The approach is through a singularity analysis of generating functions for 3- and 4-connected triangulations, asymptotic analysis, properties of the ${{}_3F_2}$ hypergeometric series, and Tutte's enumerative work on planar maps and…
We initiate the study of chromatic numbers for contact graphs of configurations of integer-sized cuboids in three dimensions, all of which are mutually congruent. Disallowing rotations, we show a global upper bound of 8 for the chromatic…
A graph is (m, k)-colourable if its vertices can be coloured with m colours such that the maximum degree of any subgraph induced on ver- tices receiving the same colour is at most k. The k-defective chromatic number for a graph is the least…
It is proved some results about existence and non existence of unit normal sections of submanifolds of the Euclidean space and sphere which associated Gauss maps are harmonic. Some applications to CMC hypersurfaces of the sphere and…
A graph G is (a:b)-colorable if there exists an assignment of b-element subsets of {1,...,a} to vertices of G such that sets assigned to adjacent vertices are disjoint. We show that every planar graph without cycles of length 4 or 5 is…