English
Related papers

Related papers: A Glazman-Povzner-Wienholtz Theorem on graphs

200 papers

In this paper we extend a classical theorem of Corr\'adi and Hajnal into the setting of sparse random graphs. We show that if $p(n) \gg (\log n / n)^{1/2}$, then asymptotically almost surely every subgraph of $G(n,p)$ with minimum degree at…

Combinatorics · Mathematics 2011-11-02 József Balogh , Choongbum Lee , Wojciech Samotij

We prove a Riemann-Roch theorem for real divisors on edge-weighted graphs over the reals, extending the result of Baker and Norine for integral divisors on graphs with multiple edges.

Algebraic Geometry · Mathematics 2017-11-13 Rodney James , Rick Miranda

Combining ideas of Pham, Sah, Sawhney, and Simkin on spread perfect matchings in super-regular bipartite graphs with an algorithmic blow-up lemma, we prove a spread version of the blow-up lemma. Intuitively, this means that there exists a…

Combinatorics · Mathematics 2024-10-10 Rajko Nenadov , Huy Tuan Pham

We study the rigidity results for self-shrinkers in Euclidean space by restriction of the image under the Gauss map. The geometric properties of the target manifolds carry into effect. In the self-shrinking hypersurface situation Theorem…

Differential Geometry · Mathematics 2012-03-07 Qi Ding , Y. L. Xin , Ling Yang

In this paper, we study commutative zero-divisor semigroups determined by graphs. We prove a uniqueness theorem for a class of graphs. We show two classes of graphs that have no corresponding semigroups. In particular, any complete graph…

Rings and Algebras · Mathematics 2007-05-23 Tongsuo Wu , Li Chen

We consider a random family of Schr\"odinger operators on a cover $X$ of a compact Riemannian manifold $M = X/\Gamma$. We present several results on their spectral theory, in particular almost sure constancy of the spectral components and…

Mathematical Physics · Physics 2018-09-28 Daniel Lenz , Norbert Peyerimhoff , Ivan Veselic'

The aim of this work is to study the Airy and Schr\"odinger operators on looping-edge graphs, a class of metric graphs consisting of a circle and a finite number $N$ of infinite half-lines attached to a common vertex. For the Airy operator,…

Analysis of PDEs · Mathematics 2026-04-14 Jaime Angulo Pava , Alexander Muñoz

We prove a Lefschetz formula for general simple graphs which equates the Lefschetz number L(T) of an endomorphism T with the sum of the degrees i(x) of simplices in G which are fixed by T. The degree i(x) of x with respect to T is defined…

Dynamical Systems · Mathematics 2012-06-06 Oliver Knill

A dominating set $S$ in a graph $G$ is said to be perfect if every vertex of $G$ not in $S$ is adjacent to just one vertex of $S$. Given a vertex subset $S'$ of a side $P_m$ of an $m\times n$ grid graph $G$, the perfect dominating sets $S$…

Combinatorics · Mathematics 2007-11-28 Italo J. Dejter , Abel A. Delgado

The notions of bounded expansion and nowhere denseness not only offer robust and general definitions of uniform sparseness of graphs, they also describe the tractability boundary for several important algorithmic questions. In this paper we…

Discrete Mathematics · Computer Science 2019-09-25 Wojciech Nadara , Marcin Pilipczuk , Roman Rabinovich , Felix Reidl , Sebastian Siebertz

We prove a far-reaching strengthening of Szemer\'edi's regularity lemma for intersection graphs of pseudo-segments. It shows that the vertex set of such a graph can be partitioned into a bounded number of parts of roughly the same size such…

Combinatorics · Mathematics 2023-12-05 Jacob Fox , Janos Pach , Andrew Suk

We study a class of PT-symmetric semiclassical Schr\"odinger operators, which are perturbations of a selfadjoint one. Here, we treat the case where the unperturbed operator has a double-well potential. In the simple well case, two of the…

Spectral Theory · Mathematics 2015-02-24 Nawal Mecherout , Naima Boussekkine , Thierry Ramond , Johannes Sjoestrand

The conjecture of Bollob\'as and Koml\'os, recently proved by B\"ottcher, Schacht, and Taraz [Math. Ann. 343(1), 175--205, 2009], implies that for any $\gamma>0$, every balanced bipartite graph on $2n$ vertices with bounded degree and…

Combinatorics · Mathematics 2011-07-28 Julia Böttcher , Peter Christian Heinig , Anusch Taraz

We investigate global solvability, in the framework of smooth functions and Schwartz distributions, of certain sums of squares of vector fields defined on a product of compact Riemannian manifolds $T \times G$, where $G$ is further assumed…

Analysis of PDEs · Mathematics 2020-10-27 Gabriel Araújo , Igor A. Ferra , Luis F. Ragognette

We consider a periodic magnetic Schr\"odinger operator on a noncompact Riemannian manifold $M$ such that $H^1(M, \RR)=0$ endowed with a properly discontinuous cocompact isometric action of a discrete group. We assume that there is no…

Spectral Theory · Mathematics 2008-01-30 Bernard Helffer , Yuri A. Kordyukov

The Wiener index $W(G)$ of a connected graph $G$ is a sum of distances between all pairs of vertices of $G$. In 1991, \v{S}olt\'{e}s formulated the problem of finding all graphs $G$ such that for every vertex $v$ the equation $W(G)=W(G-v)$…

An old problem raised independently by Jacobson and Sch\"onheim asks to determine the maximum $s$ for which every graph with $m$ edges contains a pair of edge-disjoint isomorphic subgraphs with $s$ edges. In this paper we determine this…

Combinatorics · Mathematics 2012-10-16 Choongbum Lee , Po-Shen Loh , Benny Sudakov

In this work, we study the controllability of the bilinear Schr\"odinger equation on infinite graphs for periodic quantum states. We consider the bilinear Schr\"odinger equation $i\partial_t\psi=-\Delta\psi+u(t)B\psi$ in the Hilbert space…

Analysis of PDEs · Mathematics 2020-10-20 Kaïs Ammari , Alessandro Duca

The subject of this contribution is the study of the Lov\'asz-Schrijver PSD-operator N+ applied to the edge relaxation of the stable set polytope of a graph. We are particularly interested in the problem of characterizing graphs for which…

Combinatorics · Mathematics 2015-05-18 M. Escalante , G. Nasini , A. Wagler

Given a real $\mu\geq 1$, a graph $H$ is $\mu$-almost-regular if $\Delta(H)\leq \mu \delta(H)$. The celebrated regularization theorem of Erd\H{o}s and Simonovits states that for every real $0<\varepsilon<1$ there exists a real…

Combinatorics · Mathematics 2025-07-17 Tao Jiang , Sean Longbrake
‹ Prev 1 8 9 10 Next ›