Related papers: Asymptotic dimension of intersection graphs

Suppose $\left\{x_1, \dots, x_n\right\} \subset \mathbb{R}^2$ is a set of $n$ points in the plane with diameter $\leq 1$, meaning $|x_i - x_j| \leq 1$ for all $1 \leq i,j \leq n$. We show that the ratio of the number of ``neighbors''…

Given a convex polygon of $n$ sides, one can draw $n$ disks (called side disks) where each disk has a different side of the polygon as diameter and the midpoint of the side as its center. The intersection graph of such disks is the…

The mincut graph bisection problem involves partitioning the n vertices of a graph into disjoint subsets, each containing exactly n/2 vertices, while minimizing the number of "cut" edges with an endpoint in each subset. When considered over…

We study subclasses of grid intersection graphs from the perspective of order dimension. We show that partial orders of height two whose comparability graph is a grid intersection graph have order dimension at most four. Starting from this…

A graph on $2k$ vertices is path-pairable if for any pairing of the vertices the pairs can be joined by edge-disjoint paths. The so far known families of path-pairable graphs have diameter of length at most 3. In this paper we present an…

We study convex sets C of finite (but non-zero volume in Hn and En. We show that the intersection of any such set with the ideal boundary of Hn has Minkowski (and thus Hausdorff) dimension of at most (n-1)/2, and this bound is sharp. In the…

We prove that the number s(n) of disjoint minimal graphs supported on domains in R^n is bounded by e(n+1)^2. In the two-dimensional case we show that s(2) is at most three (the conjectured number is two).

We find asymptotics of the maximum size of a chordal subgraph in a binomial random graph $G(n,p)$, for $p=\mathrm{const}$ and $p=n^{-\alpha+o(1)}$.

The intersection graph of a family of sets $\{S_{1},S_{2},\ldots,S_{n}\}$ is a graph whose vertex set is $\{S_{1},S_{2},\ldots,S_{n}\}$ and two distinct vertices are adjacent if the intersection of the corresponding sets is non-empty.…

We prove a new inequality for the asymptotic dimension of HNN-extensions. We deduce that the asymptotic dimension of every finitely generated one relator group is at most two, confirming a conjecture of A.Dranishnikov. As further…

We consider for a small parameter $\varepsilon >0$ a parabolic convection-diffusion problem with P\'eclet number of order $\mathcal{O}(\varepsilon^{-1})$ in a three-dimensional graph-like junction consisting of thin curvilinear cylinders…

We construct a sequence of subset partition graphs satisfying the dimension reduction, adjacency, strong adjacency, and endpoint count properties whose diameter has a superlinear asymptotic lower bound. These abstractions of polytope graphs…

The purpose of this note is to characterize the asymptotic dimension $asdim(X)$ of metric spaces $X$ in terms similar to Property A of Yu: If $(X,d)$ is a metric space and $n\ge 0$, then the following conditions are equivalent: [a.]…

We give a natural sufficient condition for an intersection graph of compact convex sets in R^d to have a balanced separator of sublinear size. This condition generalizes several previous results on sublinear separators in intersection…

We show that the maximum cardinality of an anti-chain composed of intersections of a given set of n points in the plane with half-planes is close to quadratic in n. We approach this problem by establishing the equivalence with the problem…

It is well-known that a paracompact space $X$ is of covering dimension at most $n$ if and only if any map $f\colon X\to K$ from $X$ to a simplicial complex $K$ can be pushed into its $n$-skeleton $K^{(n)}$. We use the same idea to…

Graph symmetries intervene in diverse applications, from enumeration, to graph structure compression, to the discovery of graph dynamics (e.g., node arrival order inference). Whereas Erd\H{o}s-R\'enyi graphs are typically asymmetric, real…

Let $G=(V(G),E(G))$ be a simple graph, and let $U\subseteq V(G)$. Two distinct vertices $x,y\in U$ are $U$-mutually visible if $G$ contains a shortest $x$-$y$ path that is internally disjoint from $U$. $U$ is called a mutual-visibility set…

We investigate the Assouad spectrum and dimension of graphs of functions lying in certain Banach spaces. We find the typical values in the sense of Baire category, proving that these values are often as large as possible, given the…

We investigate size Ramsey numbers involving bipartite graphs. It is proved that, if each forbidden graph is fixed or grows with n (in a certain uniform manner), then the extremal function has a linear asymptotics. The corresponding slope…