Search arXivSearch

arXiv · 2603.13841

Rainbow trapezoids with given area

Abstract

A well-known result by Graham in Euclidean Ramsey Theory states that, for every positive real number $A$, every coloring of the plane with finite number of colors contains a monochromatic triangle of area $A$. We consider canonical versions of this result. We show that every $3$-coloring of the plane integer lattice contains either a rainbow triangle of area $1/2$ or a monochromatic rectangle of any given area whose sides are parallell to the axes. We also show that, under natural conditions, there are numbers $A$ and $B$ such that every coloring of the plane integer lattice contains either a monochromatic rectangle of area $A$ or a rainbow trapezoid of area $B$. As usual, only vertex colors are considered: e.g., a monochromatic rectangle is a set of four points in the lattice which a) are the vertices of a rectangle and b) are assigned the same color.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sukumar Das Adhikari, Tássio Naia, Oriol Serra. 2026-03-14. Rainbow trapezoids with given area. https://arxiv.org/abs/2603.13841

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