Related papers: Eigenvalue bounds for independent sets

The $k$-independence number of a graph is the maximum size of a set of vertices at pairwise distance greater than $k$. A graph is called $k$-partially walk-regular if the number of closed walks of a given length $l\le k$, rooted at a vertex…

For a graph $G$, its $k$-th power $G^k$ is constructed by placing an edge between two vertices if they are within distance $k$ of each other. The $k$-independence number $\alpha_k(G)$ is defined as the independence number of $G^k$. By using…

We give a delocalization estimate for eigenfunctions of the discrete Laplacian on large $d+1$-regular graphs, showing that any subset of the graph supporting $\epsilon$ of the $L^2$ mass of an eigenfunction must be large. For graphs…

In this article we introduce a definition of k-uniform thresholds hypergraphs through a binary sequence, a natural extension of the classical definition for thresholds graphs. We characterize some of its eigenvalues and multiplicities by…

This paper investigates the asymptotic nature of graph spectra when some edges of a graph are subdivided sufficiently many times. In the special case where all edges of a graph are subdivided, we find the exact limits of the $k$-th largest…

Boundary analysis is developed for a rich class of generally infinite weighted graphs with compact metric completions. These graph completions have totally disconnected boundaries. The classical notion of $\epsilon$-components and the…

In this paper, we obtain some comparisons of the Dirichlet, Neumann and Laplacian eigenvalues on graphs. We also discuss their rigidities and some of their applications including some Lichnerowicz-type, Fiedler-type and Friedman-type…

In this paper, we first introduce higher order Dirichlet-to-Neumann maps on graphs which can be viewed as a discrete analogue of the corresponding Dirichlet-to-Neumann maps on compact Riemannian manifolds with boundary and a higher order…

This paper establishes new upper bounds for the sum of the $k$ largest eigenvalues of symmetric matrices. When applied to the adjacency matrix of a graph, our results improve upon a related bound due to Mohar {\bf [On the sum of k largest…

We derive a new formula for the equilibrium measure for eigenvalues of random matrices sampled from polynomial perturbations of the GUE, valid in the one-cut case. The virtue of our formula is that it depends on the potential only…

For a fixed graph G, a maximal independent set is an independent set that is not a proper subset of any other independent set. P. Erd\"os, and independently, J. W. Moon and L. Moser, and R. E. Miller and D. E. Muller, determined the maximum…

In this paper we obtain bounds for the extreme entries of the principal eigenvector of hypergraphs; these bounds are computed using the spectral radius and some classical parameters such as maximum and minimum degrees. We also study…

We give explicit isoperimetric upper bounds for all Steklov eigenvalues of a compact orientable surface with boundary, in terms of the genus, the length of the boundary, and the number of boundary components. Our estimates generalize a…

Let $G = (V,E)$ be a graph and $k \ge 0$ an integer. A $k$-independent set $S \subseteq V$ is a set of vertices such that the maximum degree in the graph induced by $S$ is at most $k$. With $\alpha_k(G)$ we denote the maximum cardinality of…

For a graph $G$, its $k$-th graph power $G^k$ is constructed by placing an edge between two vertices if they are within distance $k$. We consider the problem of deriving upper bounds on the Shannon capacity of graph powers by using spectral…

We study the asymptotics of large simple graphs constrained by the limiting density of edges and the limiting subgraph density of an arbitrary fixed graph $H$. We prove that, for all but finitely many values of the edge density, if the…

We develop a quantitative large deviations theory for random hypergraphs, which rests on tensor decomposition and counting lemmas under a novel family of cut-type norms. As our main application, we obtain sharp asymptotics for joint upper…

This paper deals with the problem of detecting non-isotropic high-dimensional geometric structure in random graphs. Namely, we study a model of a random geometric graph in which vertices correspond to points generated randomly and…

An $n$-vertex, $d$-regular graph can have at most $2^{n/2+o_d(n)}$ independent sets. In this paper we address what happens with this upper bound when we impose the further condition that the graph has independence number at most $\alpha$.…

We provide bounds on the size of polynomial differential equations obtained by executing closure properties for D-algebraic functions. While it is easy to obtain bounds on the order of these equations, it requires some more work to derive…