Related papers: Isoperimetric Inequalities on Hexagonal Grids
Among the classical variants of the Pr\"ufer surface, some are homotopy equivalent to a CW-complex (namely, a point or a wedge of a continuum of circles) and some are not. The obstruction comes from the existence of uncountably many…
Given a finite, simple graph $G$, the $k$-component order edge connectivity of $G$ is the minimum number of edges whose removal results in a subgraph for which every component has order at most $k-1$. In general, determining the…
It has been known since 1991 that the problem of recognizing grid intersection graphs is NP-complete. Here we use a modified argument of the above result to show that even if we restrict to the class of unit grid intersection graphs…
Consider a group G and a family $\mathcal{A}$ of subgroups of G. We say that vertex finiteness holds for splittings of G over $\mathcal{A}$ if, up to isomorphism, there are only finitely many possibilities for vertex stabilizers of minimal…
We use the concept of intrinsic metrics to give a new definition for an isoperimetric constant of a graph. We use this novel isoperimetric constant to prove a Cheeger-type estimate for the bottom of the spectrum which is nontrivial even if…
Interconnection networks provide an effective mechanism for exchanging data between processors in a parallel computing system. One of the most efficient interconnection networks is the hypercube due to its structural regularity, potential…
In this article, we investigate electrostatic systems with a nonzero cosmological constant on compact manifolds with boundary. We establish new geometric properties for electrostatic manifolds in higher dimensions, extending previous…
In this paper we study the relationship of hyperbolicity and (Cheeger) isoperimetric inequality in the context of Riemannian manifolds and graphs. We characterize the hyperbolic manifolds and graphs (with bounded local geometry) verifying…
We give a polynomial-time algorithm for computing upper bounds on some of the smaller energy eigenvalues in a spin-1/2 ferromagnetic Heisenberg model with any graph $G$ for the underlying interactions. An important ingredient is the…
We discuss infinitesimal isometries of the middle surfaces and present some characteristic conditions for a function to be the normal component of an infinitesimal isometry. Our results show that those characteristic conditions depend on…
This work derives an upper bound on the maximum cardinality of a family of graphs on a fixed number of vertices, in which the intersection of every two graphs in that family contains a subgraph that is isomorphic to a specified graph H.…
Over an infinite field $K$, we investigate the minimal free resolution of some configurations of lines. We explicitly describe the minimal free resolution of "complete grids of lines" and obtain an analogous result about the so-called…
A geometric grid class consists of those permutations that can be drawn on a specified set of line segments of slope \pm1 arranged in a rectangular pattern governed by a matrix. Using a mixture of geometric and language theoretic methods,…
In this paper we study two different weighted isoperimetric inequalities. In the first part of the paper we prove a sharp stability result for the isoperimetric inequality with a log-convex weight. In the second part we analize the behavior…
We establish almost tight upper and lower approximation bounds for the Vertex Cover problem on dense k-partite hypergraphs.
We discuss questions of isospectrality for hyperbolic orbisurfaces, examining the relationship between the geometry of an orbisurface and its Laplace spectrum. We show that certain hyperbolic orbisurfaces cannot be isospectral, where the…
This paper completes the project started in [10]; to solve the edge-isoperimetric problem on the (generalized and extended) Sierpinski graph, S(n,m). We prove that initial segments of lexicographic order are solutions of the EIP for all…
For a self--adjoint Laplace operator on a finite, not necessarily compact, metric graph lower and upper bounds on each of the negative eigenvalues are derived. For compact finite metric graphs Poincar\'{e} type inequalities are given.
Our main result is a sharp bound for the number of vertices in a minimal forbidden subgraph for the graphs having minimum rank at most 3 over the finite field of order 2. We also list all 62 such minimal forbidden subgraphs. We conclude by…
A vertex or edge in a graph is critical if its deletion reduces the chromatic number of the graph by 1. We consider the problems of deciding whether a graph has a critical vertex or edge, respectively. We give a complexity dichotomy for…