相关论文: A proof of Alon's second eigenvalue conjecture and…

In 1994, Alon construct a triangle-free $(n,d,\lambda)$-graph with $d = \Omega(n^{2/3})$ and $\lambda = O(d^{1/2})$ for an exponentially increasing sequence of integers $n$. Using his ingenious construction, we deduce that there exist…

In this paper, we obtain a lower bound for the smallest eigenvalue of a regular graph containing many copies of a smaller fixed subgraph. This generalizes a result of Aharoni, Alon, and Berger in which the subgraph is a triangle. We apply…

We introduce an analogue of Payne's nodal line conjecture, which asserts that the nodal (zero) set of any eigenfunction associated with the second eigenvalue of the Dirichlet Laplacian on a bounded planar domain should reach the boundary of…

This paper solves the open problem of the simplicity of the second Dirichlet eigenvalue for nearly equilateral triangles, offering a complete solution to Conjecture 6.47 posed by R. Laugesen and B. Siudeja in A. Henrot's book ``Shape…

Consider the matrix $A_{\mathcal{G}}$ chosen uniformly at random from the finite set of all $N$-dimensional matrices of zero main-diagonal and binary entries, having each row and column of $A_{\mathcal{G}}$ sum to $d$. That is, the…

A $d$-regular graph on $n$ nodes has at most $T_{\max} = \frac{n}{3} \tbinom{d}{2}$ triangles. We compute the leading asymptotics of the probability that a large random $d$-regular graph has at least $c \cdot T_{\max}$ triangles, and…

The Ramsey number r(H) of a graph H is the minimum positive integer N such that every two-coloring of the edges of the complete graph K_N on N vertices contains a monochromatic copy of H. A graph H is d-degenerate if every subgraph of H has…

We consider the statistics of extreme eigenvalues of random $d$-regular graphs, with $N^{\mathfrak c}\leq d\leq N^{1/3-{\mathfrak c}}$ for arbitrarily small ${\mathfrak c}>0$. We prove that in this regime, the fluctuations of extreme…

Consider the binomial model $G^{d+1}(n,p)$ of the random $(d+1)$-uniform hypergraph on $n$ vertices, where each edge is present, independently of one another, with probability $p:\mathbb{N}\to[0,1]$. We prove that, for all…

The irregularity strength of a graph $G$, $s(G)$, is the least $k$ admitting a $\{1,2,\ldots,k\}$-weighting of the edges of $G$ assuring distinct weighted degrees of all vertices, or equivalently the least possible maximal edge multiplicity…

We determine all graphs for which the adjacency matrix has at most two eigenvalues (multiplicities included) not equal to $-2$, or $0$, and determine which of these graphs are determined by their adjacency spectrum.

For a graph $H$, let $m(H,k)$ denote the number of vertices of degree $k$ in $H$. A conjecture of Alon and Wei states that for any $d\geq 3$, every $n$-vertex $d$-regular graph contains a spanning subgraph $H$ satisfying…

Let G_n be the random graph on [n]= {1, ...,n} with the possible edge {i,j} having probability being p_{|i-j|}= 1/|i-j|^alpha, alpha in (0,1) irrational. We prove that the zero one law (for first order logic) holds. The paper is continued…

We study the maximum dimension $d=d(n,p)$ for which an Erd\H{o}s-R\'enyi $G(n,p)$ random graph is $d$-rigid. Our main results reveal two different regimes of rigidity in $G(n,p)$ separated at $p_c=C_*\log n/n,~C_*=2/(1-\log 2)$ -- the point…

Let $G=(V,E)$ be an $n$-vertex graph, $L(G)\in \mathbb{R}^{n\times n}$ its Laplacian matrix, and let $\lambda_1(L(G))\ge \lambda_2(L(G))\ge \cdots\ge \lambda_n(L(G))=0$ denote its eigenvalues. For $1\le k\le n$, let $\varepsilon_k(G)=…

We characterize the simple connected graphs with the second largest eigenvalue less than 1/2, which consists of 13 classes of specific graphs. These 13 classes hint that $c_{2}\in [1/2, \sqrt{2+\sqrt{5}}]$, where $c_2$ is the minimum real…

Let $\Gamma$ be a finite group acting transitively on $[n]=\{1,2,\ldots,n\}$, and let $G=\mathrm{Cay}(\Gamma,T)$ be a Cayley graph of $\Gamma$. The graph $G$ is called normal if $T$ is closed under conjugation. In this paper, we obtain an…

We study a special case of the configuration model, in which almost all the vertices of the graph have degree $2$. We show that the graph has a very peculiar and interesting behaviour, in particular when the graph is made up by a vast…

Let $f(n,k)$ be the minimum number of edges that must be removed from some complete geometric graph $G$ on $n$ points, so that there exists a tree on $k$ vertices that is no longer a planar subgraph of $G$. In this paper we show that…

Alon and Krivelevich (SIAM J. Discrete Math. 15(2): 211-227 (2002)) show that if a graph is {\epsilon}-far from bipartite, then the subgraph induced by a random subset of O(1/{\epsilon}) vertices is bipartite with high probability. We…