Related papers: One Hundred and Twelve Point Three Degree Theorem

In 1975, Erd\H{o}s asked the following natural question: What is the maximum number of edges that an $n$-vertex graph can have without containing a cycle with all diagonals? Erd\H{o}s observed that the upper bound $O(n^{5/3})$ holds since…

We pose a natural generalization to the well-studied and difficult no-three-in-a-line problem: How many points can be chosen on an $n \times n$ grid such that no three of them form an angle of $\theta$? In this paper, we classify which…

We show that every bipartite planar graph with minimum degree at least 3 has proper orientation number at most 3.

In one of the three 2010/2011 issues of the journal 'MathematicalSpectrum', this author gave a three-parameter description of the entire set of integral triangles(i.e. triangles with integer side lengths)and with a 120 degree angle.This…

We show that for any natural number n, the set of domains containing absolutely periodic orbits of order n are dense in the set of bounded strictly convex domains with smooth boundary. The proof that such an orbit exists is an extension to…

We study the size of the set of ergodic directions for the directional billiard flows on the infinite band $\R\times [0,h]$ with periodically placed linear barriers of length $0<\lambda<h$. We prove that the set of ergodic directions is…

In this paper we investigate the existence of closed billiard trajectories in not necessarily smooth convex bodies. In particular, we show that if a body $K\subset \mathbb{R}^d$ has the property that the tangent cone of every non-smooth…

We consider the problem of decomposing the edges of a digraph into as few paths as possible. A natural lower bound for the number of paths in any path decomposition of a digraph $D$ is $\frac{1}{2}\sum_{v\in V(D)}|d^+(v)-d^-(v)|$; any…

In this paper we have shown without assuming the four color theorem of planar graphs that every (bridgeless) cubic planar graph has a three-edge-coloring. This is an old-conjecture due to Tait in the squeal of efforts in settling the…

A conjecture of Barnette states that every 3-connected cubic bipartite plane graph has a Hamilton cycle, which is equivalent to the statement that every simple even plane triangulation admits a partition of its vertex set into two subsets…

An approach due to Wojtkovski [9], based on the Jacobi fields, is applied to study sets of 3-period orbits in billiards on hyperbolic plane and on two-dimensional sphere. It is found that the set of 3-period orbits in billiards on…

We study dissipative polygonal outer billiards, i.e. outer billiards about convex polygons with a contractive reflection law. We prove that dissipative outer billiards about any triangle and the square are asymptotically periodic, i.e. they…

Both Cuckler and Yuster independently conjectured that when $n$ is an odd positive multiple of $3$ every regular tournament on $n$ vertices contains a collection of $n/3$ vertex-disjoint copies of the cyclic triangle. Soon after, Keevash…

We study the spectra of operators on periodic graphs using methods from combinatorial algebraic geometry. Our main result is a bound on the number of complex critical points of the Bloch variety, together with an effective criterion for…

We give a complete proof of Thurston's Orbifold Theorem for very good 3-orbifolds of cyclic type. An orbifold is said to be very good when it has a finite cover which is a manifold. A 3-orbifold is of cyclic type if the singular set is a…

We prove that every three-dimensional polyhedron is uniquely determined by its dihedral angles and edge lengths, even if nonconvex or self-intersecting, under two plausible sufficient conditions: (i) the polyhedron has only convex faces and…

We use Ratner's theorem to compute the asymptotics of the number of (cylinders of) periodic trajectories in a rectangle with a barrier, assuming that the location p/q of the barrier is rational. We also show that as q tends to infinity, the…

Let $P$ be a finite set of points in the plane. A c-ordinary triangle is a set of three non-collinear points of $P$ such that each line spanned by the points contains at most $c$ points of $P$. We show that if $P$ is not contained in the…

In the last 30 years, the mathematical theory of aperiodic order has developed enormously. Many new tilings and properties have been discovered, few of which are covered or anticipated by the early papers and books. Here, we start from the…

In this paper we prove that the surface of the cuboctahedron can be triangulated into 8 non-obtuse triangles and 12 acute triangles. Furthermore, we show that both bounds are the best possible.