Related papers: Cheng maximal diameter theorem for hypergraphs
We consider a problem posed by Erd\H{o}s, Herzog and Piranian on the maximum product of distances of a point set of order $n$ with a given diameter. We prove that it is sufficient to consider convex polygons and obtain results on the…
Let $\lambda^{*}$ be the maximum spectral radius of connected irregular graphs on $n$ vertices with maximum degree $\Delta$. Liu, Shen and Wang (2007) conjectured that $\lim_{n\rightarrow…
For every fixed dimension $d$ and sufficiently large $n$, we determine the maximum possible diameter of a strongly connected $d$-dimensional simplicial complex on $n$ vertices. This improves on a sequence of previous results and settles a…
Dirac's theorem states that any $n$-vertex graph $G$ with even integer $n$ satisfying $\delta(G) \geq n/2$ contains a perfect matching. We generalize this to $k$-uniform linear hypergraphs by proving the following. Any $n$-vertex…
We have established a coherent framework for applying variational methods to partial differential equations on hypergraphs, which includes the propositions of calculus and function spaces on hypergraphs. Several results related to the…
In this paper we prove a new Myers' type diameter estimate on a complete connected Reimannian manifold which admits a bounded vector field such that the Bakry-\'Emery Ricci tensor has a positive lower bound. The result is sharper than…
Final version in paper linked above.
We introduce some new curvature quantities such as conformal Ricci curvature and bi-Ricci curvature and extend the classical Myers theorem under these new curvature conditions. Moreover, we are able to obtain the Myers type theorem for…
The coarse Ricci curvature for Markov chains is generalized for continuous time. We show that a positive coarse Ricci curvature implies a contraction of the Markov process for the Wasserstein distance between probability measures. This…
We prove a sharp area estimate for catenoids that allows us to rule out the phenomenon of multiplicity in min-max theory in several settings. We apply it to prove that i) the width of a three-manifold with positive Ricci curvature is…
This paper considers the degree-diameter problem for undirected circulant graphs. The focus is on extremal graphs of given (small) degree and arbitrary diameter. The published literature only covers graphs of up to degree 7. The approach…
A graph is path-pairable if for any pairing of its vertices there exist edge disjoint paths joining the vertices in each pair. We obtain sharp bounds on the maximum possible diameter of path-pairable graphs which either have a given number…
We introduce a notion of fibred coarse embedding into Hilbert space for metric spaces, which is a generalization of Gromov's notion of coarse embedding into Hilbert space. It turns out that a large class of expander graphs admit such an…
In this paper we prove Schur's conjecture in $\mathbb R^d$, which states that any diameter graph $G$ in the Euclidean space $\mathbb R^d$ on $n$ vertices may have at most $n$ cliques of size $d$. We obtain an analogous statement for…
Graphs whose maximum clique size exceeds half of the total number of vertices satisfy a classical property: the family of their maximum sized cliques can be pierced by a single vertex. This result dates back to a 1965 theorem by Hajnal.…
Calabi and Cheng-Yau's Bernstein-type theorem asserts that an entire zero mean curvature graph in Lorentz-Minkowski $(n+1)$-space $\boldsymbol R^{n+1}_1$ which admits only space-like points is a hyperplane. Recently, the third and fourth…
We derive an optimal eigenvalue ratio estimate for finite weighted graphs satisfying the curvature-dimension inequality $CD(0,\infty)$. This estimate is independent of the size of the graph and provides a general method to obtain higher…
The $n$-dimensional hypercube $Q_n$ is a graph with vertex set $\{0,1\}^n$ such that there is an edge between two vertices if and only if they differ in exactly one coordinate. For any graph $H$, define $\text{ex}(Q_n,H)$ to be the maximum…
We prove a theorem on the relationships between the lengths of sides of a spherical quadrilateral with three right angles. They are analogous to the relationships in the Lambert quadrilateral in the hyperbolic plane. We apply this theorem…
We study properties of random subcomplexes of partitions returned by (a suitable form of) the Strong Hypergraph Regularity Lemma, which we call regular slices. We argue that these subcomplexes capture many important structural properties of…