Related papers: Cheng maximal diameter theorem for hypergraphs

The well known Chen's conjecture on biharmonic submanifolds states that a biharmonic submanifold in a Euclidean space is a minimal one ([10-13, 16, 18-21, 8]). For the case of hypersurfaces, we know that Chen's conjecture is true for…

We continue the study of the theories of Baldwin-Shi hypergraphs from $[5]$. Restricting our attention to when the rank $\delta$ is rational valued, we show that each countable model of the theory of a given Baldwin-Shi hypergraph is…

We consider the problem of achieving average consensus in the minimum number of linear iterations on a fixed, undirected graph. We are motivated by the task of deriving lower bounds for consensus protocols and by the so-called "definitive…

Menger's theorem - the maximum number of vertex-disjoint $X$-$Y$ paths is equal to the minimum size of an $X$-$Y$ separator - is generally not true in bidirected graphs. We prove that Menger's theorem holds true if we take the nontrivial…

In 1968, Ore determined the maximum size of $k$-connected graphs with given order and diameter. In this note, we give a new short proof.

Given a finite group $G$, the Engel graph of $G$ is a directed graph $\Gamma(G)$ encoding pairs of elements satisfying some Engel word. Namely, $\Gamma(G)$ is the directed graph, where the vertices are the non-hypercentral elements of $G$…

In this paper, we prove a number of results about pattern avoidance in graphs with bounded metric dimension or edge metric dimension. We show that the maximum possible number of edges in a graph of diameter $D$ and edge metric dimension $k$…

In this short note, based on the work of Wang-Zhu, we determine the greatest lower bounds on Ricci curvature for all toric Fano manifolds.

We give a wedge removability theorem for metrically thin sets of two codimensional Hausdorff null measure. This removability theorem combined with the wedge removability theorem of Merker for closed subsets of two codimensional manifolds,…

We show that the space of min-max minimal hypersurfaces is non-compact when the manifold has an analytic metric of positive Ricci curvature and dimension $3\leq n+1\leq 7$. Furthermore, we show that bumpy metrics with positive Ricci…

We establish the extrinsic Bonnet-Myers Theorem for compact Riemannian manifolds with positive Ricci curvature. And we show the almost rigidity for compact hypersurfaces, which have positive sectional curvature and almost maximal extrinsic…

Recently, in the paper \cite{CJKM1} we suggested the two conjectures about the diameter of io-decomposable Riordan graphs of the Bell type. In this paper, we give a counterexample for the first conjecture. Then we prove that the first…

We make several improvements on the results of M.-T. Wang in [8] and his joint paper with M.-P. Tsui [7] concerning the long time existence and convergence for solutions of mean curvature flow in higher co-dimension. Both the curvature…

We introduce a new approach and prove that the maximum number of triangles in a $C_5$-free graph on $n$ vertices is at most $$(1 + o(1)) \frac{1}{3 \sqrt 2} n^{3/2}.$$ We also show a connection to $r$-uniform hypergraphs without (Berge)…

In this paper, we study the Ricci flat manifolds with maximal volume growth using Perelman's reduced volume of Ricci flow. We show that if $(M^n,g)$ is an noncompact complete Ricci flat manifold with maximal volume growth satisfying…

In this note, we establish a local maximum principle along Ricci flow under scaling invariant curvature condition. This unifies the known preservation of nonnegativity results along Ricci flow with unbounded curvature. By combining with the…

Let $G$ be a connected nonregular graphs of order $n$ with maximum degree $\Delta$ that attains the maximum spectral radius. Liu and Li (2008) proposed a conjecture stating that $G$ has a degree sequence $(\Delta,\ldots,\Delta,\delta)$ with…

We construct a family of finite special 2-groups which have commuting graph of increasing diameter

Given an undirected graph $G$ and integers $c$ and $k$, the Maximum Edge-Colorable Subgraph problem asks whether we can delete at most $k$ edges in $G$ to obtain a graph that has a proper edge coloring with at most $c$ colors. We show that…

For $r\geq 2$ and $p\geq 1$, the $p$-spectral radius of an $r$-uniform hypergraph $H=(V,E)$ on $n$ vertices is defined to be $$\rho_p(H)=\max_{{\bf x}\in \mathbb{R}^n: \|{\bf x}\|_p=1}r \cdot \!\!\!\! \sum_{\{i_1,i_2,\ldots, i_r\}\in E(H)}…