相关论文: Optimal connectivity results for spheres in the cu…

For a fixed radius $r$ and a point $o$ in the curve complex of a surface, we define the sphere of radius $r$ to be the induced subgraph on the set of vertices of distance $r$ from $o$. We show that these spheres are almost simply connected…

We consider the curve graph in the cases where it is not a Farey graph, and show that its Gromov boundary is linearly connected. For a fixed center point c and radius r, we define the sphere of radius r to be the induced subgraph on the set…

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…

A finite simple graph G is declared to have positive curvature if every in G embedded wheel graph has five or six vertices. A d-graph is a finite simple graph G for which every unit sphere is a (d-1)-sphere. A d-sphere is a d-graph G for…

Ozkan et al. conjectured that any packing of $n$ spheres with generic radii will be stress-free, and hence will have at most $3n-6$ contacts. In this paper we prove that this conjecture is true for any sphere packing with contact graph of…

Let $G$ be a connected graph. The edge-connectivity of $G$, denoted by $\lambda(G)$, is the minimum number of edges whose removal renders $G$ disconnected. Let $\delta(G)$ be the minimum degree of $G$. It is well-known that $\lambda(G) \leq…

Among all simple 2-connected graphs, and among all $\theta$-graphs, the graphs with the minimum algebraic connectivity are completely determined, respectively.

In this paper we study the geometry of metric spheres in the curve complex of a surface, with the goal of determining the "average" distance between points on a given sphere. Averaging is not technically possible because metric spheres in…

This note is devoted to a trick which yields almost trivial proofs that certain complexes associated to topological surfaces are connected or simply connected. Applications include new proofs that the complexes of curves, separating curves,…

Among other things, it is shown that for every pair of positive integers $r$, $d$, satisfying $1<r<d\leq 2r$, and every finite simple graph $H,$ there is a connected graph $G$ with diameter $d$, radius $r$, and center $H.$

We prove a topological extension of Dirac's theorem suggested by Gowers in 2005: for any connected, closed surface $\mathscr{S}$, we show that any two-dimensional simplicial complex on $n$ vertices in which each pair of vertices belongs to…

We prove that for any closed surface of genus at least four, and any punctured surface of genus at least two, the space of ending laminations is connected. A theorem of E. Klarreich implies that this space is homeomorphic to the Gromov…

It is well-known that the Pachner graph of $n$-vertex triangulated $2$-spheres is connected, i.e., each pair of $n$-vertex triangulated $2$-spheres can be turned into each other by a sequence of edge flips for each $n\geq 4$. In this…

Over the past half century, the rigidity of graphs in $R^2$ has aroused a great deal of interest. Lov\'{a}sz and Yemini (1982) proved that every $6$-connected graph is rigid in $R^2$. Jackson and Jord\'{a}n (2005) provided a similar…

We define and study analogs of curve graphs for infinite type surfaces. Our definitions use the geometry of a fixed surface and vertices of our graphs are infinite multicurves which are bounded in both a geometric and a topological sense.…

Let $\Sigma$ be a compact immersed stable capillary hypersurface in a wedge bounded by two hyperplanes in $\mathbb R^{n+1}$. Suppose that $\Sigma$ meets those two hyperplanes in constant contact angles and is disjoint from the edge of the…

We determine the minimum sum--connectivity index of bicyclic graphs with $n$ vertices and matching number $m$, where $2\le m\le \lfloor\frac{n}{2}\rfloor$, the minimum and the second minimum, as well as the maximum and the second maximum…

The $W_v$-Path Conjecture due to Klee and Wolfe states that any two vertices of a simple polytope can be joined by a path that does not revisit any facet. This is equivalent to the well-known Hirsch Conjecture. Klee proved that the…

In 1970 Smith classified all connected graphs with the spectral radius at most $2$. Here the spectral radius of a graph is the largest eigenvalue of its adjacency matrix. Recently, the definition of spectral radius has been extended to…

Let G be a connected, compact, semisimple Lie group. It is known that for a compact closed orientable surface $\Sigma$ of genus $l >1$, the order of the group $H^2(\Sigma,\pi_1(G))$ is equal to the number of connected components of the…