Related papers: Surfaces have (asymptotic) dimension 2

We prove a version of the countable union theorem for asymptotic dimension and we apply it to groups acting on asymptotically finite dimensional metric spaces. As a consequence we obtain the following finite dimensionality theorems. A) An…

While Szemer\'edi's graph regularity lemma is an indispensable tool for studying extremal problems in graph theory, using it comes with a hefty price, since a worst-case graph may only have regular partitions of tower-type size. It is thus…

We prove an asymptotic analog of the classical Hurewicz theorem on mappings which lower dimension. This theorem allows us to find sharp upper bound estimates for the asymptotic dimension of groups acting on finite dimensional metric spaces…

The dissertation is related to combinatorial geometry with a strong probabilistic flavor. The main results can be split into three parts. The results of the first part guarantee that each "unit distance graph" in the plane has an induced…

The Gram dimension $\gd(G)$ of a graph is the smallest integer $k \ge 1$ such that, for every assignment of unit vectors to the nodes of the graph, there exists another assignment of unit vectors lying in $\oR^k$, having the same inner…

In 1967, Katona and Szemer\'{e}di showed that no undirected graph with $n$ vertices and fewer than $\frac{n}{2}\log_2\frac{n}{2}$ edges admits an orientation of diameter two. In 1978, Chv\'atal and Thomassen revealed the complexity of…

The Vapnik-\v{C}ervonenkis dimension is a complexity measure of set-systems, or hypergraphs. Its application to graphs is usually done by considering the sets of neighborhoods of the vertices (cf. Alon et al. (2006) and Chepoi, Estellon,…

In every dimension $n\ge 3$ we introduce a class of orthogonal graph-manifolds and prove that the fundamental group of any orthogonal graph-manifold quasi-isometrically embeds into a product of $n$ trees. As a consequence, we obtain that…

Let $G$ be a dense graph with good expansion properties and not too close to being bipartite. Let $\boldsymbol d$ be a graphical degree sequence. Under very weak conditions, we find the number of subgraphs of $G$ with degree sequence…

We show that posets of bounded height whose cover graphs exclude a fixed graph as a topological minor have bounded dimension. This result was already proven by Walczak. However, our argument is entirely combinatorial and does not rely on…

In this paper we show that the asymptotic dimension of an unbounded proper metric space is bounded above by a coarse analog of Ponomarev's cofinal dimension of topological spaces, which we call the coarse cofinal dimension. We also show…

We give quadratic upper bounds for the asymptotic dimensions of the arc graphs and disk graphs.

We prove a coarse version of Halin's Grid Theorem: Every one-ended, locally finite graph that contains the disjoint union of infinitely many rays as an asymptotic minor also contains the half-grid as an asymptotic minor. More generally, we…

We introduce the class of outerspatial 2-complexes as the natural generalisation of the class of outerplanar graphs to three dimensions. Answering a question of O-joung Kwon, we prove that a locally 2-connected 2-complex is outerspatial if…

We define the class of high dimensional graph manifolds. These are compact smooth manifolds supporting a decomposition into finitely many pieces, each of which is diffeomorphic to the product of a torus with a finite volume hyperbolic…

Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, the greatest reduced average density (grad) of G with rank r,…

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…

We introduce a method to embed edge-colored graphs into families of expander graphs, which generalizes a framework developed by Dragani\'c, Krivelevich, and Nenadov (2022). As an application, we show that each family of sufficiently…

A 2-edge-colored graph or a signed graph is a simple graph with two types of edges. A homomorphism from a 2-edge-colored graph $G$ to a 2-edge-colored graph $H$ is a mapping $\varphi: V(G) \rightarrow V(H)$ that maps every edge in $G$ to an…

The series-parallel (SP) graphs are those containing no topological $K_{_4}$ and are considered trivial. We relax the prohibition distinguishing the SP graphs by forbidding only embeddings of $K_{_4}$ whose edges with both ends 3-valent…