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

Seymour's Second Neighborhood Conjecture (SNC) states that every oriented graph contains a vertex whose second neighborhood is as large as its first neighborhood. We investigate the SNC for orientations of both binomial and pseudo random…

Let $(n^+, n^0, n^-)$ denote the inertia of a graph $G$ with $n$ vertices. Nordhaus-Gaddum bounds are known for inertia, except for an upper bound for $n^-$. We conjecture that for any graph \[ n^-(G) + n^-(\bar{G}) \le 1.5(n - 1), \] and…

For a graph $G$, let $\lambda_2(G)$ denote the second largest eigenvalue of the adjacency matrix of $G$. We determine the extremal trees with maximum/minimum adjacency eigenvalue $\lambda_2$ in the class $\mathcal{T}(n,d)$ of $n$-vertex…

The Graph Reconstruction Conjecture famously posits that any undirected graph on at least three vertices is determined up to isomorphism by its family of (unlabeled) induced subgraphs. At present, the conjecture admits partial resolutions…

For an oriented graph $D$, the inversion of $X\subseteq V(D)$ in $D$ is the graph obtained by reversing the orientation of all arcs with both ends in $X$. The inversion number $\mathrm{inv}(D)$ is the minimum number of inversions needed to…

In this paper, we prove an upper bound on the second non-zero Laplacian eigenvalue on $n$-dimensional real projective space. The sharp result for 2-dimensions was shown by Nadirashvili and Penskoi and later by Karpukhin when the metric…

We study eigenvalue distribution of the adjacency matrix $A^{(N,p, \alpha)}$ of weighted random bipartite graphs $\Gamma= \Gamma_{N,p}$. We assume that the graphs have $N$ vertices, the ratio of parts is $\frac{\alpha}{1-\alpha}$ and the…

Aldous' spectral gap conjecture asserts that on any graph the random walk process and the random transposition (or interchange) process have the same spectral gap. We prove the conjecture using a recursive strategy. The approach is a…

The matrix $A:\mathbb{R}^n \to \mathbb{R}^m$ is $(\delta,k)$-regular if for any $k$-sparse vector $x$, $$ \left| \|Ax\|_2^2-\|x\|_2^2\right| \leq \delta \sqrt{k} \|x\|_2^2. $$ We show that if $A$ is $(\delta,k)$-regular for $1 \leq k \leq…

The reconfiguration graph $R_k(G)$ of the $k$-colourings of a graph $G$ has as vertex set the set of all possible $k$-colourings of $G$ and two colourings are adjacent if they differ on the colour of exactly one vertex. Cereceda conjectured…

We study the behaviour of random labelled and unlabelled cographs with n vertices as n tends to infinity. Our main result is a novel probabilistic limit in the space of graphons.

Given a fixed graph H, what is the (exponentially small) probability that the number X_H of copies of H in the binomial random graph G_{n,p} is at least twice its mean? Studied intensively since the mid 1990s, this so-called infamous upper…

We prove that the number of perfect matchings in ${\mathcal G}(n,d)$ is asymptotically normal when $n$ is even, $d\to\infty$ as $n\to\infty$, and $d=O(n^{1/7}/\log^2 n)$. This is the first distributional result of spanning subgraphs of…

We prove that if an $n\times n$ matrix defined over ${\mathbb Q}_p$ (or more generally an arbitrary complete, discretely-valued, non-Archimedean field) satisfies a certain congruence property, then it has a strictly maximal eigenvalue in…

Backhausz and Szegedy (2019) demonstrated that the almost eigenvectors of random regular graphs converge to Gaussian waves with variance $0\leq \sigma^2\leq 1$. In this paper, we present an alternative proof of this result for the edge…

Finding general conditions which ensure that a graph is Hamiltonian is a central topic in graph theory. An old and well known conjecture in the area states that any $d$-regular $n$-vertex graph $G$ whose second largest eigenvalue in…

We consider a class of sparse random matrices which includes the adjacency matrix of the Erd\H{o}s-R\'enyi graph $\mathcal{G}(N,p)$. We show that if $N^{\varepsilon} \leq Np \leq N^{1/3-\varepsilon}$ then all nontrivial eigenvalues away…

For a simple finite graph G denote by {G \brace k} the number of ways of partitioning the vertex set of G into k non-empty independent sets (that is, into classes that span no edges of G). If E_n is the graph on n vertices with no edges…

We prove two mixed versions of the Discrete Nodal Theorem of Davies et. al. [3] for bounded degree graphs, and for three-connected graphs of fixed genus $g$. Using this we can show that for a three-connected graph satisfying a certain…

It is proven that the eigenvalue process of Dyson's random matrix process of size two becomes non-Markov if the common coefficient $1/\sqrt{2}$ in the non-diagonal entries is replaced by a different positive number.