Related papers: Univoque graphs and multiple expansions

We prove that the maximum number of edges in a 3-uniform linear hypergraph on $n$ vertices containing no 2-regular subhypergraph is $n^{1+o(1)}$. This resolves a conjecture of Dellamonica, Haxell, Luczak, Mubayi, Nagle, Person, R\"odl,…

A $(d_1,d_2)$-biregular bipartite graph $G=(L\cup R,E)$ is called left-$(m,\delta)$ unique-neighbor expander iff each subset $S$ of the left vertices with $|S|\leq m$ has at least $\delta d_1|S|$ unique-neighbors, where unique-neighbors…

Coverings of undirected graphs are used in distributed computing, and unfoldings of directed graphs in semantics of programs. We study these two notions from a graph theoretical point of view so as to highlight their similarities, as they…

The purpose of this note is to point out that the theory of expander graphs leads to an interesting test whether $n$ real numbers $x_1, \dots, x_n$ could be $n$ independent samples of a random variable. To any distinct, real numbers $x_1,…

In 2018, Dankelmann, Gao, and Surmacs [J. Graph Theory, 88(1): 5--17, 2018] established sharp bounds on the oriented diameter of a bridgeless undirected graph and a bridgeless undirected bipartite graph in terms of vertex degree. In this…

Graph operations or products play an important role in complex networks. In this paper, we study the properties of $q$-subdivision graphs, which have been applied to model complex networks. For a simple connected graph $G$, its…

It is proved that there exist graphs of bounded degree with arbitrarily large queue-number. In particular, for all $\Delta\geq3$ and for all sufficiently large $n$, there is a simple $\Delta$-regular $n$-vertex graph with queue-number at…

Models of discrete space and space-time that exhibit continuum-like behavior at large lengths could have profound implications for physics. They may tame the infinities that arise from quantizing gravity, and dispense with the machinery of…

We resolve the computational complexity of Graph Isomorphism for classes of graphs characterized by two forbidden induced subgraphs $H_1$ and $H_2$ for all but six pairs $(H_1,H_2)$. Schweitzer had previously shown that the number of open…

A \emph{queue layout} of a graph consists of a \emph{linear order} of its vertices and a partition of its edges into \emph{queues}, so that no two independent edges of the same queue are nested. The \emph{queue number} of a graph is the…

We show that for the base two expansion \[ x=\sum_{i=1}^{\infty}2^{-(d_{1}(x)+d_{2}(x)+\dots+d_{i}(x))}\] with $x\in(0,1]$ and $d_{i}(x)\in\mathbb{N}$ the set $A=\{x|\lim_{i\to\infty}d_{i}(x)=\infty\}$ has Hausdorff dimension zero, this is…

There has been interest recently in maximizing the number of independent sets in graphs. For example, the Kahn-Zhao theorem gives an upper bound on the number of independent sets in a $d$-regular graph. Similarly, it is a corollary of the…

In this note, we give very simple constructions of unique neighbor expander graphs starting from spectral or combinatorial expander graphs of mild expansion. These constructions and their analysis are simple variants of the constructions of…

We show that the Hausdorff dimension of the set of points of bounded orbit in the Julia set of a meromorphic map with a simply connected direct tract and a certain restriction on the singular values is strictly greater than one. This result…

In this article, we prove that if $X$ is a complex manifold of dimension $n\geq 4$ such that there exists a $q$-convex with corners function $f\in F_{q}(X)$, then every holomorphic line bundle over $\{f>c\}$ extends uniquely to $X$ if…

The number of independent sets in regular bipartite expander graphs can be efficiently approximated by expressing it as the partition function of a suitable polymer model and truncating its cluster expansion. While this approach has been…

We show that the set defined by digit restrictions contains arbitrarily long arithmetic progressions if and only if its Assouad dimension is one. Moreover, we show that for any $0\le s\le 1$, there exists some set on $\mathbb{R}$ with…

We investigate and quantify the distinction between rectifiable and purely unrectifiable 1-sets in the plane. That is, given that purely unrectifiable 1-sets always have null intersections with Lipschitz images, we ask whether these sets…

An independent transversal in a multipartite graph is an independent set that intersects each part in exactly one vertex. We show that for every even integer $r\ge 2$, there exist $c_r>0$ and $n_0$ such that every $r$-partite graph with…

A set of $n$ points in the Euclidean plane determines at least $n$ distinct lines unless these $n$ points are collinear. In 2006, Chen and Chv\'atal asked whether the same statement holds true in general metric spaces, where the line…