Related papers: The 3-state Potts model on planar triangulations: …

The 3SUM problem asks if an input $n$-set of real numbers contains a triple whose sum is zero. We consider the 3POL problem, a natural generalization of 3SUM where we replace the sum function by a constant-degree polynomial in three…

A Gallai $k$-colouring of a graph $G$ is a colouring of $E(G)$ with $k$ colours that induces no rainbow triangles, that is, a triangle with edges of 3 different colours. We give a first step towards estimating the number of Gallai…

Combining tree decomposition and transfer matrix techniques provides a very general algorithm for computing exact partition functions of statistical models defined on arbitrary graphs. The algorithm is particularly efficient in the case of…

Recent advances in experiment and theory suggest that superfluid $^3$He under planar confinement may form a pair density wave (PDW) whereby superfluid and crystalline orders coexist. While a natural candidate for this phase is a…

In spite of the extensive studies of the 3-coloring problem with respect to several basic parameters, the complexity status of the 3-coloring problem on graphs with small diameter, i.e. with diameter 2 or 3, has been a longstanding and…

We introduce and study a natural class of Anderson t- modules, called triangular t-modules, characterized by having Drinfeld modules as their $\tau$-composition factors. They form a homologically meaningful generalization of Drinfeld…

For a number $\ell\geq 2$, let $\mathcal{H}_{\ell}$ denote the family of graphs which have girth $2\ell$ and have no even hole with length greater than $2\ell$. Wu, Xu, and Xu conjectured that every graph in…

Thomassen formulated the following conjecture: Every $3$-connected cubic graph has a red-blue vertex coloring such that the blue subgraph has maximum degree $1$ (that is, it consists of a matching and some isolated vertices) and the red…

We use the nested loop approach to investigate loop models on random planar maps where the domains delimited by the loops are given two alternating colors, which can be assigned different local weights, hence allowing for an explicit Z_2…

In this first of four articles, we study a homogeneous system of $2N+3$ linear partial differential equations (PDEs) in $2N$ variables that arises in conformal field theory (CFT) and multiple Schramm-Lowner evolution (SLE). In CFT, these…

We determine all the Kummer-surface-type Calabi-Yau (CY) 3-folds, i.e., those $\hat{T/G}$ which are resolutions of 3-torus-orbifolds $T/G$ with only isolated singularities. There are only two such CY spaces: one with $G= \ZZ_3$ and $T$…

A recent lower bound on the number of edges in a k-critical n-vertex graph by Kostochka and Yancey yields a half-page proof of the celebrated Gr\"otzsch Theorem that every planar triangle-free graph is 3-colorable. In this paper we use the…

The colored Tverberg theorem asserts that for every d and r there exists t=t(d,r) such that for every set C in R^d of cardinality (d+1)t, partitioned into t-point subsets C_1,C_2,...,C_{d+1} (which we think of as color classes; e.g., the…

Around 10 years ago, Agol and Krushkal showed that the number of chromatic polynomials $P_{G}$ arising from graphs $G$ on $n$ vertices grows exponentially with $n$, by establishing that the (dual) flow polynomial…

There is a sufficiently large $N\in h\mathbb{N}$ such that the following holds. If $G$ is a tripartite graph with $N$ vertices in each vertex class such that every vertex is adjacent to at least $2N/3+2h-1$ vertices in each of the other…

We compute the generating function of random planar quadrangulations with three marked vertices at prescribed pairwise distances. In the scaling limit of large quadrangulations, this discrete three-point function converges to a simple…

Ward and Szab\'o [WS94] have shown that a complete graph with $N^2$ nodes whose edges are colored by $N$ colors and that has at least two colors contains a bichromatic triangle. This fact leads us to a total search problem: Given an…

We describe an algorithm for generating all $k$-critical $\mathcal H$-free graphs, based on a method of Ho\`{a}ng et al. Using this algorithm, we prove that there are only finitely many $4$-critical $(P_7,C_k)$-free graphs, for both $k=4$…

An injective colouring of a graph is a colouring in which every two vertices sharing a common neighbour receive a different colour. Chen, Hahn, Raspaud and Wang conjectured that every planar graph of maximum degree $\Delta \ge 3$ admits an…

We prove modularity for any irreducible crystalline $\ell$-adic odd 2-dimensional Galois representation (with finite ramification set) unramified at 3 verifying an "ordinarity at 3" easy to check condition, with Hodge-Tate weights $\{0, w…