Related papers: The Colin de Verdi\`ere Graph Parameter for Thresh…

Recently, Cardoso, Houri and Kimura constructed generalized ladder operators for massive Klein-Gordon scalar fields in space-times with conformal symmetry. Their construction requires a closed conformal Killing vector, which is also an…

One of the key results in Robertson and Seymour's seminal work on graph minors is the Grid-Minor Theorem (also called the Excluded Grid Theorem). The theorem states that for every grid $H$, every graph whose treewidth is large enough…

Harry Buhrman et al gave an Omega(sqrt n) lower bound for monotone graph properties in the adjacency matrix query model. Their proof is based on the polynomial method. However for some properties stronger lower bounds exist. We give an…

The Moore bound constitutes both an upper bound on the order of a graph of maximum degree $d$ and diameter $D=k$ and a lower bound on the order of a graph of minimum degree $d$ and odd girth $g=2k+1$. Graphs missing or exceeding the Moore…

Hierarchical graph clustering is a common technique to reveal the multi-scale structure of complex networks. We propose a novel metric for assessing the quality of a hierarchical clustering. This metric reflects the ability to reconstruct…

This introduction to graphs and graph algebras provides the optimal bound for the number of all paths of length $k$ in a graph with $N\geq k$ edges and no loops. Our proof relies on a construction of a number of terminating algorithms that…

It is known that any planar graph with diameter D has treewidth O(D), and this fact has been used as the basis for several planar graph algorithms. We investigate the extent to which similar relations hold in other graph families. We show…

Sequences of certain finite graphs, antitrees, are constructed along which the Anderson model shows GOE statistics, i.e. a re-scaled eigenvalue process converges to the ${\rm Sine}_1$ process. The Anderson model on the graph is a random…

We consider Schroedinger operators with a random potential of alloy type on infinite metric graphs which obey certain uniformity conditions. For single site potentials of fixed sign we prove that the random Schroedinger operator restricted…

We prove a new upper bound for the minimum $d$-degree threshold for perfect matchings in $k$-uniform hypergraphs when $d<k/2$. As a consequence, this determines exact values of the threshold when $0.42k \le d < k/2$ or when $(k,d)=(12,5)$…

We consider graphs for which the non-backtracking matrix has defective eigenvalues, or graphs for which the matrix does not have a full set of eigenvectors. The existence of these values results in Jordan blocks of size greater than one,…

Given a graph $G$, let $\lambda_3$ denote the third largest eigenvalue of its adjacency matrix. In this paper, we prove various results towards the conjecture that $\lambda_3(G) \le \frac{|V(G)|}{3}$, motivated by a question of Nikiforov.…

We establish a criterion for a set of eigenfunctions of the one-dimensional Schr\"{o}dinger operator with distributional potentials and boundary conditions containing the eigenvalue parameter to be a Riesz basis for $\mathscr{L}_2(0,\pi)$.

Given feasible strongly regular graph parameters $(v,k,\lambda,\mu)$ and a non-negative integer $d$, we determine upper and lower bounds on the order of a $d$-regular induced subgraph of any strongly regular graph with parameters…

We consider the Bernoulli bond percolation process (with parameter $p$) on infinite graphs and we give a general criterion for bounded degree graphs to exhibit a non-trivial percolation threshold based either on a single isoperimetric…

We construct a class of matrix-valued Schr\"odinger operators with prescribed finite-band spectra of maximum spectral multiplicity. The corresponding matrix potentials are shown to be stationary solutions of the KdV hierarchy. The methods…

The vertex expansion of the graph is a fundamental graph parameter. Given a graph $G=(V,E)$ and a parameter $\delta \in (0,1/2]$, its $\delta$-Small-Set Vertex Expansion (SSVE) is defined as \[ \min_{S : |S| = \delta |V|}…

Let G=(V,E) be a graph with f:V\to Z_+ a function assigning degree bounds to vertices. We present the first efficient algebraic algorithm to find an f-factor. The time is \tilde{O}(f(V)^{\omega}). More generally for graphs with integral…

Generating novel molecules with optimal properties is a crucial step in many industries such as drug discovery. Recently, deep generative models have shown a promising way of performing de-novo molecular design. Although graph generative…

We give variants of the Krein bound and the absolute bound for graphs with a spectrum similar to that of a strongly regular graph. In particular, we investigate what we call approximately strongly regular graphs. We apply our results to…