Related papers: Absence of zeros implies strong spatial mixing
In the mid-1990s, Stanley and Stembridge conjectured that the chromatic symmetric functions of claw-free co-comparability (also called incomparability) graphs were e-positive. The quest for the proof of this conjecture has led to an…
For large-scale testing with graph-associated data, we present an empirical Bayes mixture technique to score local false discovery rates. Compared to empirical Bayes procedures that ignore the graph, the proposed method gains power in…
In the sufficiently sparse case, we find the probability that a uniformly random bipartite graph with given degree sequence contains no edge from a specified set of edges. This enables us to enumerate loop-free digraphs and oriented graphs…
A graph $G$ is \emph{chordless} if no cycle in $G$ has a chord. In the present work we investigate the chromatic index and total chromatic number of chordless graphs. We describe a known decomposition result for chordless graphs and use it…
We study the zeros of random power series with stationary complex Gaussian coefficients, whose spectral measure is absolutely continuous. We analyze the precise asymptotic behavior of the radial density of zeros near the boundary of the…
Given linearly independent holomorphic functions $f_0,...,f_n$ on a planar domain $\Omega$, let $\mathcal E$ be the set of those points $z\in\Omega$ where a nontrivial linear combination $\sum_{j=0}^n\lambda_jf_j$ may have a zero of…
We prove quantum ergodicity and quantum mixing for sequences of finite Schreier graphs converging to an infinite Cayley graph whose adjacency operator has absolutely continuous spectrum. Under Benjamini-Schramm convergence (or strong…
In this paper, we study graphs whose matching polynomial have only integer zeros. A graph is matching integral if the zeros of its matching polynomial are all integers. We characterize all matching integral traceable graphs.. We show that…
We examine ordered graphs, defined as graphs with linearly ordered vertices, from the perspective of homomorphisms (and colorings) and their complexities. We demonstrate the corresponding computational and parameterized complexities, along…
We develop a theory for the existence of perfect matchings in hypergraphs under quite general conditions. Informally speaking, the obstructions to perfect matchings are geometric, and are of two distinct types: 'space barriers' from convex…
Generalising the Heilman-Lieb Theorem from statistical physics, Chudnovsky and Seymour [J. Combin. Theory Ser. B, 97(3):350--357] showed that the univariate independence polynomial of any claw-free graph has all of its zeros on the negative…
We design an efficient sampling algorithm to generate samples from the hardcore model on random regular bipartite graphs as long as $\lambda \lesssim \frac{1}{\sqrt{\Delta}}$, where $\Delta$ is the degree. Combined with recent work of…
A graph homomorphism is a vertex map which carries edges from a source graph to edges in a target graph. The instances of the Weighted Maximum H-Colourable Subgraph problem (MAX H-COL) are edge-weighted graphs G and the objective is to find…
We investigate the space complexity of certain perfect matching problems over bipartite graphs embedded on surfaces of constant genus (orientable or non-orientable). We show that the problems of deciding whether such graphs have (1) a…
We prove that zeros and critical points of a random polynomial $p_N$ of degree $N$ in one complex variable appear in pairs. More precisely, if $p_N$ is conditioned to have $p_N(\xi)=0$ for a fixed $\xi \in \C\backslash\set{0},$ we prove…
I show that there exist universal constants $C(r) < \infty$ such that, for all loopless graphs $G$ of maximum degree $\le r$, the zeros (real or complex) of the chromatic polynomial $P_G(q)$ lie in the disc $|q| < C(r)$. Furthermore, $C(r)…
We study the space $H(\SO)$ of all homomorphisms of the vector lattice of all slowly oscillating functions on the half-line $\HH=[0,\infty)$. In contrast to the case of homomorphisms of uniformly continuous functions, it is shown that a…
The hardcore model is a fundamental probabilistic model extensively studied in statistical physics, probability theory, and computer science. For graphs of maximum degree $\Delta$, a well-known computational phase transition occurs at the…
Statistical physics models with hard constraints, such as the discrete hard-core gas model (random independent sets in a graph), are inherently combinatorial and present the discrete mathematician with a relatively comfortable setting for…
In a recent work (ECCC, TR18-171, 2018), we introduced models of testing graph properties in which, in addition to answers to the usual graph-queries, the tester obtains {\em random vertices drawn according to an arbitrary distribution…