Related papers: A note on Erd\H{o}s's mysterious remark

The Erd\H{o}s-Szekeres conjecture states that any set of more than $2^{n-2}$ points in the plane with no three on a line contains the vertices of a convex $n$-gon. Erd\H{o}s, Tuza, and Valtr strengthened the conjecture by stating that any…

We prove that (i) a generalization of the Steiner-Lehmus theorem due to A. Henderson holds in Bachmann's standard ordered metric planes, (ii) that a variant of Steiner-Lehmus holds in all metric planes, and (iii) that the fact that a…

This proof without words demonstrates that there are $\binom{n+2}{4}$ equilateral triangles in the regular $n$-vertices-per-side triangular grid by describing a map from four-element subsets of $\{1,2, \dots, n+2\}$ into the set of…

The triangle covering number of a graph is the minimum number of vertices that hit all triangles. Given positive integers $s,t$ and an $n$-vertex graph $G$ with $\lfloor n^2/4 \rfloor +t$ edges and triangle covering number $s$, we determine…

We consider Shanks' simplest cubic fields $K$ for which the index $[\mathcal{O}_K:\mathbb{Z}[\rho]]$ of a root $\rho$ of the defining parametric polynomial is $3$. For them, we study the additive indecomposables of $K$ and provide a…

Considering regular graphs with every edge in a triangle we prove lower bounds for the number of triangles in such graphs. For r-regular graphs with r <= 5 we exhibit families of graphs with exactly that number of triangles and then…

A rotational subset, relative to a continuous transformation $T: \mathbb{T} \to \mathbb{T}$ on the unit circle, is a closed, invariant subset of $\mathbb{T}$ that is minimal and on which $T$ respects the standard orientation of the unit…

In this paper, we investigate the minimum number of triangles, denoted by $t(n,k)$, in $n$-vertex $k$-regular graphs, where $n$ is an odd integer and $k$ is an even integer. The well-known Andr\'asfai-Erd\H{o}s-S\'os Theorem has established…

We prove that for every $N\ne 4$ there is only one right triangle that tiles the regular $N$-gon.

The famous Brown-Erd\H{o}s-S\'os conjecture from 1973 states, in an equivalent form, that for any fixed $\delta>0$ and integer $k\geq 3$ every sufficiently large linear $3$-uniform hypergraph of size $\delta n^2$ contains some $k$ edges…

The non-trivial complete totally geodesic submanifolds of the complex hyperbolic plane $\mathbb H_{\mathbb C}^2$ are the complex geodesics and the real planes. We present two new proofs for this fact. One is a short proof based on an…

In general graph theory, the only relationship between vertices are expressed via the edges. When the vertices are embedded in an Euclidean space, the geometric relationships between vertices and edges can be interesting objects of study.…

Using Schmidt's Subspace Theorem, this paper improves and extends an existing transcendence result for sequences of algebraic numbers. The theorems thus produced correspond to a central theorem on the irrationality of sequences due to…

The celebrated Brown-Erd\H{o}s-S\'os conjecture states that for every fixed $e$, every $3$-uniform hypergraph with $\Omega(n^2)$ edges contains $e$ edges spanned by $e+3$ vertices. Up to this date all the approaches towards resolving this…

We deal with unweighted and weighted enumerations of lozenge tilings of a hexagon with side lengths $a,b+m,c,a+m,b,c+m$, where an equilateral triangle of side length $m$ has been removed from the center. We give closed formulas for the…

Let $d \geq 3$ be a natural number. We show that for all finite, non-empty sets $A \subseteq \mathbb{R}^d$ that are not contained in a translate of a hyperplane, we have \[ |A-A| \geq (2d-2)|A| - O_d(|A|^{1- \delta}),\] where $\delta >0$ is…

Erd\H{o}s conjectured in 1946 that every n-point set P in convex position in the plane contains a point that determines at least floor(n/2) distinct distances to the other points of P. The best known lower bound due to Dumitrescu (2006) is…

This is a report on a failed attempt to construct new graphs that are strongly regular with no triangles. The approach is based on the assumption that the second subconstituent has an equitable partition with four parts. For infinitely many…

We show that there is a constant $c$ such that any 3-uniform hypergraph $\mathcal H$ with $n$ vertices and at least $cn^{5/2}$ edges contains a triangulation of the real projective plane as a subgraph. This resolves a conjecture of…

If one erects regular hexagons upon the sides of a triangle $T$, several surprising properties emerge, including: (i) the triangles which flank said hexagons have an isodynamic point common with $T$, (ii) the construction can be extended…