Related papers: Aldous property for full-flag Johnson graphs
The total matching polytope generalizes the stable set polytope and the matching polytope. In this paper, we first propose new facet-defining inequalities for the total matching polytope. We then give an exponential-sized, non-redundant…
The Gordian graph and H(2)-Gordian graphs of knots are abstract graphs whose vertex sets represent isotopy classes of unoriented knots, and whose edge sets record whether pairs of knots are related by crossing changes or H(2)-moves,…
The Laplacian energy of a graph is the sum of the distances of the eigenvalues of the Laplacian matrix of the graph to the graph's average degree. The maximum Laplacian energy over all graphs on $n$ nodes and $m$ edges is conjectured to be…
In this paper, we give sufficient conditions on the spectral radius for a bipartite graph to Hamiltonian and traceable, which expand the results of Lu, Liu and Tian (2012) [10]. Furthermore, we also present tight sufficient conditions on…
Whenever graphs admit equitable partitions, their quotient graphs highlight the structure evidenced by the partition. It is therefore very natural to ask what can be said about two graphs that have the same quotient according to certain…
We prove a version of the moving particle lemma for the exclusion process on any finite weighted graph, based on the octopus inequality of Caputo, Liggett, and Richthammer. In light of their proof of Aldous' spectral gap conjecture, we…
We consider two-sided Jacobi matrices whose coefficients are obtained by continuous sampling along the orbits of a homeomorphim of a compact metric space. Given an ergodic probability measure, we study the topological structure of the…
A graph $G$ contains a strong parity factor $F$ if for every subset $X\subseteq V(G)$ with $|X|$ even, $G$ has a spanning subgraph $F$ satisfying $\delta(F)\geq1$, $d_F(u)\equiv1$ (mod 2) for any $u\in X$, and $d_F(v)\equiv0$ (mod 2) for…
In new progress on conjectures of Stein, and Addario-Berry, Havet, Linhares Sales, Reed and Thomass\'e, we prove that every oriented graph with all in- and out-degrees greater than 5k/8 contains an alternating path of length k. This…
We consider rectangular graph superlattices of sides l1, l2 with the wavefunction coupling at the junctions either of the delta type, when they are continuous and the sum of their derivatives is proportional to the common value at the…
We provide an optimal sufficient condition, relating minimum degree and bandwidth, for a graph to contain a spanning subdivision of the complete bipartite graph $K_{2,\ell}$. This includes the containment of Hamilton paths and cycles, and…
An $[a,b]$-factor of a graph $G$ is a spanning subgraph $H$ such that $a\leq d_{H}(v)\leq b$ for each $v\in V(G)$. In this paper, we provide spectral conditions for the existence of an odd $[1,b]$-factor in a connected graph with minimum…
In this paper we generalize to the case of partial flags a result proved both by Spaltenstein and by Steinberg that relates the relative position of two complete flags and the irreducible components of the flag variety in which they lie,…
We present a new explicit construction for expander graphs with nearly optimal spectral gap. The construction is based on a series of 2-lift operations. Let $G$ be a graph on $n$ vertices. A 2-lift of $G$ is a graph $H$ on $2n$ vertices,…
Bollob\'{a}s and Scott [5] conjectured that every graph $G$ has a balanced bipartite spanning subgraph $H$ such that for each $v\in V(G)$, $d_H(v)\ge (d_G(v)-1)/2$. In this paper, we show that every graphic sequence has a realization for…
The $N$ vertices of a quantum random graph are each a circle independently punctured at Poisson points of arrivals, with parallel connections derived through for each pair of these punctured circles by yet another independent Poisson…
In this paper, we present an equitable partition theorem of tensors, which gives the relations between $H$-eigenvalues of a tensor and its quotient equitable tensor and extends the equitable partitions of graphs to hypergraphs. Furthermore,…
The spectral dimension $d_s$ of a weighted graph is an exponent associated with the asymptotic behavior of the random walk on the graph. The Ahlfors regular conformal dimension $\dim_\mathrm{ARC}$ of the graph distance is a quasisymmetric…
We consider Schr\"odinger operators with periodic potentials on periodic discrete graphs. Their spectrum consists of a finite number of bands. We obtain two-sided estimates of the total bandwidth for the Schr\"odinger operators in terms of…
We consider selfadjoint operators obtained by pasting a finite number of boundary relations with one-dimensional boundary space. A typical example of such an operator is the Schr\"odinger operator on a star-graph with a finite number of…