Related papers: Integer Triangles with R/r=N
We consider the isoperimetric problem in planar sectors with density $r^{p}$, and with density $a>1$ inside the unit disk and $1$ outside. We characterize solutions as a function of sector angle. We also solve the isoperimetric problem in…
Given integers $r$ and $b$ with $1 \leq b \leq r$, a finite simple connected graph $G$ for which ${\rm reg}(S/I(G)) = r$ and the number of extremal Betti numbers of $S/I(G)$ is equal to $b$ will be constructed.
An n-simplex is called circumscriptible (or edge-incentric) if there is a sphere tangent to all its n(n + 1)/2 edges. We obtain a closed formula for the radius of the circumscribed sphere of the circumscriptible n-simplex, and also prove a…
A simple graph is called triangular if every edge of it belongs to a triangle. We conjecture that any graphical degree sequence all terms of which are greater than or equal to 4 has a triangular realisation, and establish this conjecture…
We introduce and study arithmetic polygons. We show that these arithmetic polygons are connected to triples of square pyramidal numbers. For every odd $N\geq3$, we prove that there is at least one arithmetic polygon with $N$ sides. We also…
We consider right prisms with horizontal quadrilateral bases and tops, and vertical rectangular sides. We look for examples where all the edges, face diagonals and space diagonals are integers. We find examples when the base is an isosceles…
A famous conjecture of Caccetta and H\"aggkvist is that in a digraph on $n$ vertices and minimum out-degree at least $\frac{n}{r}$ there is a directed cycle of length $r$ or less. We consider the following generalization: in an undirected…
Two Latin squares of order $n$ are $r$-orthogonal if, when superimposed, there are exactly $r$ distinct ordered pairs. The spectrum of all values of $r$ for Latin squares of order $n$ is known. A Latin square $A$ of order $n$ is…
We present a collection of results concerning the location and distribution of very triangular numbers among triangular numbers, including the twin very triangular number theorem, the existence of arbitrarily long gaps between -- and an…
We completely describe the structure of the connected components of transversals to a collection of n line segments in R^3. We show that n>2 arbitrary line segments in R^3 admit 0, 1, ..., n or infinitely many line transversals. In the…
The graph crossing number problem, cr(G)<=k, asks for a drawing of a graph G in the plane with at most k edge crossings. Although this problem is in general notoriously difficult, it is fixed- parameter tractable for the parameter k…
A triangle $T'$ is $\varepsilon$-similar to another triangle $T$ if their angles pairwise differ by at most $\varepsilon$. Given a triangle $T$, $\varepsilon>0$ and $n\in\mathbb{N}$, B\'ar\'any and F\"uredi asked to determine the maximum…
We show that for any positive integer $r$ there exists an integer $k$ and a $k$-colouring of the edges of $K_{2^{k}+1}$ with no monochromatic odd cycle of length less than $r$. This makes progress on a problem of Erd\H{o}s and Graham and…
Given integers $r>d\ge 0$ and an $r$-partite graph, an independent $(r-d)$-transversal or $(r-d)$-IT is an independent set of size $r-d$ that intersects each part in at most one vertex. We show that every $r$-partite graph with maximum…
An ear in a triangulation $T$ of a convex $n$-gon $P$ is a triangle of $T$ that shares two sides with $P$ itself. Certain enumerational and structural problems become easier when one considers only triangulations with few ears. We…
In this paper, we consider the problem of representing graphs by triangles whose sides touch. As a simple necessary condition, we show that pairs of vertices must have a small common neighborhood. On the positive side, we present linear…
In this paper we use an elementary approach by using numerical semigroups (specifically, those with two generators) to give a formula for the number of integral points inside a right-angled triangle with rational vertices. This is the basic…
Let ABC be a triangle with a,b,and c being its three sidelengths. In a 1976 article by Wynne William Wilson in the Mathematical Gazette(see reference[2]), the author showed that angleB is twice angleA, if and only if b^2=a(a+c). We offer…
By a simple method we prove the following conjecture on Sharygin triangles: there is only one Sharygin triangle (up to an isometry) whose vertices are chosen from the set of vertices of a regular polygon inscribed in a circle of radius 1.
We give exact formulas for the number of distinct triangular patterns (or subtriangles) of a given size that occur in the Sierpi\'{n}ski Triangle.