Search arXivSearch

arXiv · 2512.19080

Chromatic numbers for contact graphs of congruent cuboids

Abstract

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 numbers, which implies that there is a global upper bound of 48 when the cuboids may be rotated freely. Specializing further to cuboids that are required to have a side length of one we obtain more precise upper bounds. Such upper bounds are compared to examples of configurations having relatively large chromatic numbers, leading to a complete determination of some of these chromatic numbers, but in general, the gaps between our upper and lower bounds are rather wide. In particular, we know of no such configuration of any size leading to a chromatic number above 6.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Søren Eilers, Rune Johansen, Rasmus Veber Rasmussen, Carsten Thomassen. 2025-12-22. Chromatic numbers for contact graphs of congruent cuboids. https://arxiv.org/abs/2512.19080

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO