Related papers: Levinson's theorem for graphs
We introduce the Density Formula for (topological) drawings of graphs in the plane or on the sphere, which relates the number of edges, vertices, crossings, and sizes of cells in the drawing. We demonstrate its capability by providing…
We find the asymptotic number of connected graphs with $k$ vertices and $k-1+l$ edges when $k,l$ approach infinity, reproving a result of Bender, Canfield and McKay. We use the {\em probabilistic method}, analyzing breadth-first search on…
If K is an odd-dimensional flag closed manifold, flag generalized homology sphere or a more general flag weak pseudomanifold with sufficiently many vertices, then the maximal number of edges in K is achieved by the balanced join of cycles.…
Recently developed time-independent bound-state perturbation theory is extended to treat the scattering domain. The changes in the partial wave phase shifts are derived explicitly and the results are compared with those of other methods.
Graph states are multi-particle entangled states that correspond to mathematical graphs, where the vertices of the graph take the role of quantum spin systems and edges represent Ising interactions. They are many-body spin states of…
An asymptotic analysis for a system with equation and dynamic boundary condition of Cahn-Hilliard type is carried out as the coefficient of the surface diffusion acting on the phase variable tends to 0, thus obtaining a forward-backward…
A bipartite graph $G$ is semi-algebraic in $\mathbb{R}^d$ if its vertices are represented by point sets $P,Q \subset \mathbb{R}^d$ and its edges are defined as pairs of points $(p,q) \in P\times Q$ that satisfy a Boolean combination of a…
We show that the spectrum of the Schrodinger operator on a finite, metric graph determines uniquely the connectivity matrix and the bond lengths, provided that the lengths are non-commensurate and the connectivity is simple (no parallel…
We establish the following splitter theorem for graphs and its generalization for matroids: Let $G$ and $H$ be $3$-connected simple graphs such that $G$ has an $H$-minor and $k:=|V(G)|-|V(H)|\ge 2$. Let $n:=\left\lceil k/2\right\rceil+1$.…
One of the earliest results in extremal graph theory, Mantel's theorem, states that the maximum number of edges in a triangle-free graph $G$ on $n$ vertices is $\lfloor n^2/4 \rfloor$. We investigate how this extremal bound is affected when…
In \cite{Elek} we proved that the limit of a weakly convergent sequence of finite graphs can be viewed as a graphing or a continuous field of infinite graphs. Thus one can associate a type $II_1$-von Neumann algebra to such graph sequences.…
A graph is \emph{hamiltonian-connected} if every pair of vertices can be connected by a hamiltonian path, and it is \emph{hamiltonian} if it contains a hamiltonian cycle. We construct families of non-hamiltonian graphs for which the ratio…
In this paper, we initiate the study of the vertex coloring problem of a graph in the semi streaming model. In this model, the input graph is defined by a stream of edges, arriving in adversarial order and any algorithm must process the…
We establish splitter theorems for graph immersions for two families of graphs, $k$-edge-connected graphs, with $k$ even, and 3-edge-connected, internally 4-edge-connected graphs. As a corollary, we prove that every $3$-edge-connected,…
Addressing a question posed by Chen and Ma from an asymptotic point of view, we present a short proof for the edge density needed to guarantee that two vertices of the same degree are connected by a path of a fixed length. In particular, we…
The purpose of this paper is to prove some results on the absence of bound states for certain nonlinear Schr\"odinger equations on noncompact metric graphs with localized nonlinearity. In particular, we show how the topological and metric…
Yes it does ! Indeed an extended version of Levinson's theorem is proposed for a system involving complex eigenvalues. The perturbed system corresponds to a realization of the Schroedinger operator with inverse square potential on the…
A general problem of $2\rightarrow N_f$ scattering is addressed with all the states being wave packets with arbitrary phases. Depending on these phases, one deals with coherent states in $(3+1)$ D, vortex particles with orbital angular…
We consider the cubic nonlinear Schr\"{o}dinger equation on the star graph with the Kirchhoff boundary condition. We prove modified scattering for the final state problem and the initial value problem. Moreover, we also consider the failure…
In this paper we prove a new result about partitioning coloured complete graphs and use it to determine certain Ramsey numbers exactly. The partitioning theorem we prove is that for k at least 1, in every edge colouring of a complete graph…