Related papers: On the multiplicities of digraph eigenvalues
We show that for any closed surface of genus greater than one and for any finite weighted graph filling the surface, there exists a hyperbolic metric which realizes the least Dirichlet energy harmonic embedding of the graph among a fixed…
Two graphs are co-spectral if their respective adjacency matrices have the same multi-set of eigenvalues. A graph is said to be determined by its spectrum if all graphs that are co-spectral with it are isomorphic to it. We consider these…
We develop eigenvalue estimates for the Laplacians on discrete and metric graphs using different types of boundary conditions at the vertices of the metric graph. Via an explicit correspondence of the equilateral metric and discrete graph…
Determining the maximum number of edges in an intersecting hypergraph on a fixed ground set under additional constraints is one of the central topics in extremal combinatorics. In contrast, there are few results on analogous problems…
We develop a theory of graph algebras over general fields. This is modeled after the theory developed by Freedman, Lov\'asz and Schrijver in [22] for connection matrices, in the study of graph homomorphism functions over real edge weight…
Half graphs and their variants, such as ladders, semi-ladders and co-matchings, are combinatorial objects that encode total orders in graphs. Works by Adler and Adler (Eur. J. Comb.; 2014) and Fabia\'nski et al. (STACS; 2019) prove that in…
We develop a clear connection between deFinetti's theorem for exchangeable arrays (work of Aldous--Hoover--Kallenberg) and the emerging area of graph limits (work of Lovasz and many coauthors). Along the way, we translate the graph theory…
Let $G$ be a simple graph with the Laplacian matrix $L(G)$ and let $e(G)$ be the number of edges of $G$. A conjecture by Brouwer and a conjecture by Grone and Merris state that the sum of the $k$ largest Laplacian eigenvalues of $G$ is at…
In this work, we are concerned with hierarchically hyperbolic spaces and hierarchically hyperbolic groups. Our main result is a wide generalization of a combination theorem of Behrstock, Hagen, and Sisto. In particular, as a consequence, we…
Given a graph G of order n and size m, let s(G)= sum|d(u)-2m/n|, where the sum is taken over all vertices u of G. We investigate upper and lower bounds on eigenvalues of G in terms of s(G).
The study of the graph diameter of polytopes is a classical open problem in polyhedral geometry and the theory of linear optimization. In this paper we continue the investigation initiated in [4] by introducing a vast hierarchy of…
Given a set of nonempty subsets of some universal set, their intersection graph is defined as the graph with one vertex for each set and two vertices are adjacent precisely when their representing sets have non-empty intersection. Sometimes…
In this paper, we prove the conjectures of Gharakhloo and Welker (2023) that the positive matching decomposition number (pmd) of a $3$-uniform hypergraph is bounded from above by a polynomial of degree $2$ in terms of the number of…
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…
In 1985, Golumbic and Scheinerman established an equivalence between comparability graphs and containment graphs, graphs whose vertices represent sets, with edges indicating set containment. A few years earlier, McMorris and Zaslavsky…
Recently Rohleder proposed a new variational approach to an inequality between the Neumann and Dirichlet eigenvalues in the simply connected planar case using the language of classical vector analysis. Writing his approach in terms of…
This paper generalizes and unifies the existing spectral bounds on the $k$-independence number of a graph, which is the maximum size of a set of vertices at pairwise distance greater than $k$. The previous bounds known in the literature…
We define the independence ratio and the chromatic number for bounded, self-adjoint operators on an L^2-space by extending the definitions for the adjacency matrix of finite graphs. In analogy to the Hoffman bounds for finite graphs, we…
Extremal graph theory studies the maximum or minimum number of subgraphs isomorphic to a prescribed graph under given constraints. \textit{Localization} has recently emerged as a framework that refines such problems by assigning extremal…
The purpose of this paper is to give explicit methods for bounding the number of vertices of finite $k$-regular graphs with given second eigenvalue. Let $X$ be a finite $k$-regular graph and $\mu_1(X)$ the second largest eigenvalue of its…