Related papers: Triangles and Vitali sets
For each infinite cardinal k, the set of algebraic hypergraphs having chromatic number no larger than k is decidable.
This paper shows how a recent reformulation of the basics of classical geometry and trigonometry reveals a three-fold symmetry between Euclidean and non-Euclidean (relativistic) planar geometries. We apply this chromogeometry to look at…
Motivated by an old conjecture of P. Erd\H{o}s and V. Neumann-Lara, our aim is to investigate digraphs with uncountable dichromatic number and orientations of undirected graphs with uncountable chromatic number. A graph has uncountable…
We construct a family F of compact and pathwise connected subsets of the Euclidean plane such that (i) the cardinality of F is that of the continuum (and hence extremely large) and (ii) if X,Y are distinct spaces in F then there never…
It is proved to be consistent relative to a measurable cardinal that there is a uniform ultrafilter on the real numbers which is generated by fewer than the maximum possible number of sets. It is also shown to be consistent relative to a…
A triangle in a hypergraph is a collection of distinct vertices u,v,w and distinct edges e,f,g with u,v \in e, v,w \in f, w,u \in g, and \{u,v,w\} \cap e \cap f \cap g=\emptyset. The i-degree of a vertex in a hypergraph is the number of…
We prove that the number of Hamiltonian paths on the complement of an acyclic digraph is equal to the number of cycle covers. As an application, we obtain a new expansion of the chromatic symmetric function of incomparability graphs in…
The work presents the brief exposition of the proof (in ZF) of inaccessible cardinals nonexistence. To this end in view there is used the apparatus of subinaccessible cardinals and its basic tools -- reduced formula spectra and matrices and…
We prove that the fractional chromatic number $\chi_f(\mathbb R^2)$ of the unit distance graph of the Euclidean plane is greater than or equal to $4$. Interestingly, however, we cannot present a finite subgraph $G$ of the plane such that…
We present an elementary construction of an uncountably chromatic graph without uncountable, infinitely connected subgraphs.
It is proved that in Godel's constructible universe, for every infinite successor cardinal k, there exist graphs G and H of size and chromatic number k, for which the tensor product graph (G x H) is countably chromatic.
This paper develops a rich theory of cardinality in the paraconsistent and paracomplete set theory $\mathrm{BZFC}$, where sets can be inconsistent ($A$ such that ``$x\in A$'' is both true and false for some $x$) or incomplete ($A$ such that…
We prove that subsets of ${\Bbb R}^d$, $d \ge 4$ of large enough Hausdorff dimensions contain vertices of an equilateral triangle. It is known that additional hypotheses are needed to assure the existence of equilateral triangles in two…
Deciding whether a planar graph (even of maximum degree $4$) is $3$-colorable is NP-complete. Determining subclasses of planar graphs being $3$-colorable has a long history, but since Gr\"{o}tzsch's result that triangle-free planar graphs…
A lattice equable quadrilateral is a quadrilateral in the plane whose vertices lie on the integer lattice and which is equable in the sense that its area equals its perimeter. This paper treats the tangential and extangential cases. We show…
Starting from a supercompact cardinal we build a model in which $2^{\aleph_{\omega_1}}=2^{\aleph_{\omega_1+1}}=\aleph_{\omega_1+3}$ but there is a jointly universal family of size $\aleph_{\omega_1+2}$ of graphs on $\aleph_{\omega_1+1}$.…
Several classical constructions illustrate the fact that the chromatic number of a graph can be arbitrarily large compared to its clique number. However, until very recently, no such construction was known for intersection graphs of…
By the Grunbaum-Aksenov Theorem (extending Grotzsch's Theorem) every planar graph with at most three triangles is 3-colorable. However, there are infinitely many planar 4-critical graphs with exactly four triangles. We describe all such…
We prove that every triangle-free graph of tree-width t has chromatic number at most ceil((t + 3)/2), and demonstrate that this bound is tight. The argument also establishes a connection between coloring graphs of tree-width t and on-line…
For a set of nonnegative integers $c_1, \ldots, c_k$, a $(c_1, c_2,\ldots, c_k)$-coloring of a graph $G$ is a partition of $V(G)$ into $V_1, \ldots, V_k$ such that for every $i$, $1\le i\le k, G[V_i]$ has maximum degree at most $c_i$. We…