English
Related papers

Related papers: The Six-Point Circle Theorem

200 papers

We show that every minimum area isosceles triangle containing a given triangle $T$ shares a side and an angle with $T$. This proves a conjecture of Nandakumar motivated by a computational problem. We use our result to deduce that for every…

Metric Geometry · Mathematics 2020-09-04 Gergely Kiss , János Pach , Gábor Somlai

We propose the following conjecture extending Dirac's theorem: if $G$ is a graph with $n\ge 3$ vertices and minimum degree $\delta(G)\ge n/2$, then in every orientation of $G$ there is a Hamilton cycle with at least $\delta(G)$ edges…

Combinatorics · Mathematics 2023-03-13 Lior Gishboliner , Michael Krivelevich , Peleg Michaeli

We prove that any set of points in $\mathbb{R}^d$, any three of which form an angle less than $\frac{\pi}{3} + c$, has size $(1+\Theta(c))^d$ for sufficiently small $c>0$. The proof is based on a refinement of an approach by Erd\H{o}s and…

Combinatorics · Mathematics 2022-07-18 Miroslav Marinov

Let $G$ be a graph and $\lambda(G)$ be the spectral radius of $G$. A previous result due to Nikiforov [Linear Algebra Appl., 2009] in spectral graph theory asserted that every graph $G$ on $m\geq 10$ edges contains a 4-cycle if…

Combinatorics · Mathematics 2025-10-14 Bo Ning , Mingqing Zhai

It is easy to find a right-angled triangle with integer sides whose area is 6. There is no such triangle with area 5, but there is one with rational sides (a `\emph{Pythagorean triangle}'). For historical reasons, integers such as 6 or 5…

Number Theory · Mathematics 2007-12-27 Alf van der Poorten

Let D be a digraph and C be a cycle in D. For any two vertices x and y in D, the distance from x to y is the minimum length of a path from x to y. We denote the square of Let $D$ be a digraph and $C$ be a cycle in $D$. For any two vertices…

Combinatorics · Mathematics 2024-07-29 Jie Zhang , Zhilan Wang , Jin Yan

Given a noncompact disconnected complete periodic curve $\Gamma$ with no self intersection in $\mathbb R^3$, it is proved that there exists a noncompact simply connected periodic minimal surface spanning $\Gamma$. As an application it is…

Differential Geometry · Mathematics 2021-08-24 Jaigyoung Choe

Let $\alpha(n)$ be the least number $k$ for which there exists a simple graph with $k$ vertices having precisely $n \geq 3$ spanning trees. Similarly, define $\beta(n)$ as the least number $k$ for which there exists a simple graph with $k$…

Combinatorics · Mathematics 2013-02-12 Jernej Azarija , Riste Škrekovski

We conjecture that every oriented graph $G$ on $n$ vertices with $\delta ^+ (G) , \delta ^- (G) \geq 5n/12$ contains the square of a Hamilton cycle. We also give a conjectural bound on the minimum semidegree which ensures a perfect packing…

Combinatorics · Mathematics 2010-11-22 Andrew Treglown

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…

General Mathematics · Mathematics 2012-03-13 Konstantine Zelator

We prove that every locally Hamiltonian graph with $n\ge 3$ vertices and possibly with multiple edges has at least $3n-6$ edges with equality if and only if it triangulates the sphere. As a consequence, every edge-maximal embedding of a…

Combinatorics · Mathematics 2020-01-15 James Davies , Carsten Thomassen

We prove the following results on flag triangulations of 2- and 3-manifolds. In dimension 2, we prove that the vertex-minimal flag triangulations of $\mathbb{R} P^2$ and $\mathbb{S}^1\times \mathbb{S}^1$ have 11 and 12 vertices,…

Combinatorics · Mathematics 2020-11-25 Christin Bibby , Andrew Odesky , Mengmeng Wang , Shuyang Wang , Ziyi Zhang , Hailun Zheng

Let F be a finite field of characteristic p. We consider smooth surfaces over F(t) defined by an equation f+tg=0, where f and g are forms of degree d in 4 variables with coefficients in F, with d prime to p. We prove : For such surfaces…

Algebraic Geometry · Mathematics 2010-12-03 Jean-Louis Colliot-Thélène , Sir Peter Swinnerton-Dyer

Dirac proved that any graph with minimum vertex degree $\delta$ contains either a cycle of length at least $2\delta$ or a Hamilton cycle. Motivated by this result, we characterize those graphs having no cycle longer than $2\delta$.

Combinatorics · Mathematics 2007-05-23 Galen E. Turner

We consider closed chains of circles $C_1,C_2,\ldots,C_n,C_{n+1}=C_1$ such that two neighbouring circles $C_i,C_{i+1}$ intersect or touch each other with $A_i$ being a common point. We formulate conditions such that a polygon with vertices…

General Mathematics · Mathematics 2025-02-25 Norbert Hungerbühler

Two vertex-labelled polygons are \emph{compatible} if they have the same clockwise cyclic ordering of vertices. The definition extends to polygonal regions (polygons with holes) and to triangulations---for every face, the clockwise cyclic…

Computational Geometry · Computer Science 2017-06-29 Anna Lubiw , Debajyoti Mondal

In 2003, Bohman, Frieze, and Martin initiated the study of randomly perturbed graphs and digraphs. For digraphs, they showed that for every $\alpha>0$, there exists a constant $C$ such that for every $n$-vertex digraph of minimum…

Combinatorics · Mathematics 2023-10-16 Igor Araujo , József Balogh , Robert A. Krueger , Simón Piga , Andrew Treglown

We give synthetic proofs of many new results in triangle geometry, focusing especially on fixed points of certain affine maps which are defined in terms of the cevian triangle $DEF$ of a point $P$ with respect to a given triangle $ABC$, as…

General Mathematics · Mathematics 2017-11-28 Igor Minevich , Patrick Morton

In this paper we show the existence of global minimizers for the geometrically exact, non-linear equations of elastic plates, in the framework of the general 6-parametric shell theory. A characteristic feature of this model for shells is…

Analysis of PDEs · Mathematics 2013-03-11 Mircea Birsan , Patrizio Neff

In this short note it is shown that every graph of diameter 2 and minimum degree at least 3 contains a cycle of length 4 or 8. This result contributes to the study of the Erd\H{o}s-Gy\'arf\'as Conjecture by confirming it for the class of…

Combinatorics · Mathematics 2026-02-02 Avery Carr