相关论文: A new proof of Vazsonyi's conjecture

The circumference of a graph is the length of its longest cycles. Jackson established a conjecture of Bondy by showing that the circumference of a 3-connected cubic graph of order $n$ is $\Omega(n^{0.694})$. Bilinski {\it et al.} improved…

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…

We prove two mixed versions of the Discrete Nodal Theorem of Davies et. al. [3] for bounded degree graphs, and for three-connected graphs of fixed genus $g$. Using this we can show that for a three-connected graph satisfying a certain…

We give a short survey of problems and results on (1) diameter graphs and hypergraphs, and (2) geometric Ramsey theory. We also make some modest contributions to both areas. Extending a well known theorem of Kahn and Kalai which disproved…

A set of $n$ points in the Euclidean plane determines at least $n$ distinct lines unless these $n$ points are collinear. In 2006, Chen and Chv\'atal asked whether the same statement holds true in general metric spaces, where the line…

Inspired by a recently formulated conjecture by Bannai et al. we investigate spherical codes which admit exactly three different distances and are spherical 5-designs. Computing and analyzing distance distributions we provide new proof of…

Two digraphs of order $n$ are said to pack if they can be found as edge-disjoint subgraphs of the complete digraph of order $n$. It is well established that if the sum of the sizes of the two digraphs is at most $2n-2$, then they pack, with…

In this paper, we present an alternative proof of a finiteness theorem due to Bombieri, Masser and Zannier concerning intersections of a curve in the multiplicative group of dimension n with algebraic subgroups of dimension n-2. The proof…

In this paper it is proved that there are constants 0< c_2< c_1 such that an asymptotic formula can be given for the the number of (labeled) n-vertex graphs of diameter d whenever n tends to infinity and 2 < d < n - c_1 (log n). A typical…

The Three Gap Theorem states that there are at most three distinct lengths of gaps if one places $n$ points on a circle, at angles of $z, 2z, 3z, \ldots nz$ from the starting point. The theorem was first proven in 1958 by S\'os and many…

We establish that every embedding of a Grassmann graph in a polar Grassmann graph can be reduced to an embedding in a Grassmann graph or to an embedding in the collinearity graph of a polar space. Also, we consider $3$-embeddings, i.e.…

We prove some contact analogs of smooth embedding theorems for closed $\pi$-manifolds. We show that a closed, $k$-connected, $\pi$-manifold of dimension (2n + 1) that bounds a $\pi$-manifold, contact embeds in the $(4n-2k+3)$-dimensional…

Convex geometries are closure systems satisfying the anti-exchange axiom. Every finite convex geometry can be embedded into a convex geometry of finitely many points in an n-dimensional space equipped with a convex hull operator, by the…

In 1975, Erd\H{o}s asked for the maximum number of edges that an $n$-vertex graph can have if it does not contain two edge-disjoint cycles on the same vertex set. It is known that Tur\'an-type results can be used to prove an upper bound of…

A generic immersion of a planar graph into the 2-space is said to be knotted if there does not exist a trivial embedding of the graph into the 3-space obtained by lifting the immersion with respect to the natural projection from the 3-space…

The bellows conjecture claims that the volume of any flexible polyhedron of dimension 3 or higher is constant during the flexion. The bellows conjecture was proved for flexible polyhedra in the Euclidean spaces of dimensions 3 and higher,…

In this paper, the isodiametric problem for centrally symmetric convex bodies in the Euclidean d-space R^d containing no interior non-zero point of a lattice L is studied. It is shown that the intersection of a suitable ball with the…

Every graph G can be embedded in a Euclidean space as a two-distance set. The Euclidean representation number of G is the smallest dimension in which G is representable by such an embedding. We consider spherical and J-spherical…

The Gaussian Correlation Conjecture states that for any two symmetric, convex sets in n-dimensional space and for any centered, Gaussian measure on that space, the measure of the intersection is greater than or equal to the product of the…

Brightwell, van den Heuvel and Stougie proved that the diameter of an $m \times n$ transportation polytope is at most $8(m+n-2)$, a factor of eight away from the Hirsch Conjecture. This bound was improved to $3(m+n-1)$ by Hurkens. We…