Related papers: Limits, Regularity and Removal for Finite Structur…

We consider large uniform labeled random graphs in different classes with prescribed decorations in their modular decomposition. Our main result is the estimation of the number of copies of every graph as an induced subgraph. As a…

We prove a generalized isoperimetric inequality for a domain diffeomorphic to a sphere that replaces filling volume with $k$-dilation. Suppose $U$ is an open set in $\mathbb{R}^n$ diffeomorphic to a Euclidean $n$-ball. We show that in…

This article emphasizes an extension of the study of metric and par- tition dimension to hypergraphs. We give a sharp lower bounds for the metric and partition dimension of hypergraphs in general and give exact values under specified…

Words are sequences of letters over a finite alphabet. We study two intimately related topics for this object: quasi-randomness and limit theory. With respect to the first topic we investigate the notion of uniform distribution of letters…

Let $k\geq 2$ and fix a $k$-uniform hypergraph $\mathcal{F}$. Consider the random process that, starting from a $k$-uniform hypergraph $\mathcal{H}$ on $n$ vertices, repeatedly deletes the edges of a copy of $\mathcal{F}$ chosen uniformly…

We prove that harmonic maps into Euclidean buildings, which are not necessarily locally finite, have singular sets of Hausdorff codimension 2, extending the locally finite regularity result of Gromov and Schoen. As an application, we prove…

In this paper we study the following problem. Let $A$ be a fixed graph, and let $\hom(G,A)$ denote the number of homomorphisms from a graph $G$ to $A$. Furthermore, let $v(G)$ denote the number of vertices of $G$, and let $\mathcal{G}_d$…

We introduce a reducibility on classes of structures, essentially a uniform enumeration reducibility. This reducibility is inspired by the Friedman-Stanley paper on using Borel reductions to compare classes of countable structures. This…

We establish uniformization results for metric spaces that are homeomorphic to the euclidean plane or sphere and have locally finite Hausdorff 2-measure. Applying the geometric definition of quasiconformality, we give a necessary and…

In this paper, we introduce some reduction processes on graphs which preserve the regularity of related edge ideals. As a consequence, an alternative proof for the theorem of R. Fr\"oberg on linearity of resolution of edge ideal of graphs…

Ioffe's criterion and various reformulations of it have become a~standard tool in proving theorems guaranteeing metric regularity of a (set-valued) mapping. First, we demonstrate that one should always use directly the so-called general…

We show that uniform lattices of isometries of products of real hyperbolic spaces act properly discontinuously and cocompactly on a median space. For lattices in products of at least two factors, this is the strongest degree of…

We obtain several sharp spectral bounds, approximations, and exact values for the isoperimetric number and related edge-expansion parameters of graphs. Our results focus on graph powers and on families of graphs with rich algebraic or…

The theory of graph limits represents large graphs by analytic objects called graphons. Graph limits determined by finitely many graph densities, which are represented by finitely forcible graphons, arise in various scenarios, particularly…

This work explores the deformation theory of algebraic structures in a very general setting. These structures include commutative, associative algebras, Lie algebras, and the infinity versions of these structures, the strongly homotopy…

This paper studies regularity of perimiter quasiminimizing sets in metric measure spaces with a doubling measure and a Poincare inequality. The main result shows that the measure theoretic boundary of a quasiminimizing set coincides with…

The well-known regularity lemma of E. Szemer\'edi for graphs (i.e. 2-uniform hypergraphs) claims that for any graph there exists a vertex partition with the property of quasi-randomness. We give a simple construction of such a partition. It…

The Kruskal-Katona theorem together with a theorem of Razborov determine the closure of the set of points defined by the homomorphism density of the edge and the triangle in finite graphs. The boundary of this region is a countable union of…

Let $K_d$ denote the class of all finite graphs and, for graphs $A\subseteq B$, say $A \leq_d B$ if distances in $A$ are preserved in $B$; i.e. for $a, a' \in A$ the length of the shortest path in $A$ from $a$ to $a'$ is the same as the…

This paper collates, presents, and expands upon technology and results obtained as part of the author's PhD thesis. We generalize work done in the $\sigma$-finite setting by the author, Goldbring, Hart, and Sinclair by producing a language…