Related papers: Realizing trees of configurations in thin sets

We analyze some local properties of sparse Erdos-Renyi graphs, where $d(n)/n$ is the edge probability. In particular we study the behavior of very short paths. For $d(n)=n^{o(1)}$ we show that $G(n,d(n)/n)$ has asymptotically almost surely…

We generalize the structure theorem of Robertson and Seymour for graphs excluding a fixed graph $H$ as a minor to graphs excluding $H$ as a topological subgraph. We prove that for a fixed $H$, every graph excluding $H$ as a topological…

A set in the Euclidean plane is constructed whose image under the classical Radon transform is Lipschitz in every direction. It is also shown that, under mild hypotheses, for any such set the function which maps a direction to the…

Let $X$ and $Y$ be compact Hausdorff spaces, and let $C(X)$ and $C(Y)$ denote the commutative Banach algebras of all continuous complex-valued functions on $X$ and $Y$, respectively. We study bijective maps $T$ from $C(X)$ onto $C(Y)$ which…

We prove that for any positive integers $k$ and $d$, if a graph $G$ has maximum average degree at most $2k + \frac{2d}{d+k+1}$, then $G$ decomposes into $k+1$ pseudoforests $C_{1},\ldots,C_{k+1}$ such that there is an $i$ such that for…

The pseudoforest version of the Strong Nine Dragon Tree Conjecture states that if a graph $G$ has maximum average degree $\text{mad}(G) = 2 \max_{H \subseteq G} \frac{e(G)}{v(G)}$ at most $2(k + \frac{d}{k+d+1})$, then it has a…

We study a generalization of the Erd\H{o}s-Falconer distance problem over finite fields. For a graph $G$, two embeddings $p, p': V(G) \to \mathbb{F}_q^d$ of a graph $G$ are congruent if for all edges $(v_i, v_j)$ of $G$ we have that…

In recent years, Radon type transforms that integrate functions over various sets of ellipses/ellipsoids have been considered in SAR, ultrasound reflection tomography, and radio tomography. In this paper, we consider the transform that…

Rotation distance between trees measures the number of simple operations it takes to transform one tree into another. There are no known polynomial-time algorithms for computing rotation distance. In the case of ordered rooted trees, we…

We study a general procedure that builds random $\mathbb R$-trees by gluing recursively a new branch on a uniform point of the pre-existing tree. The aim of this paper is to see how the asymptotic behavior of the sequence of lengths of…

As an extension of a classical tree-partition problem, we consider decompositions of graphs into edge-disjoint (rooted-)trees with an additional matroid constraint. Specifically, suppose we are given a graph $G=(V,E)$, a multiset…

We prove that every oriented tree on $n$ vertices with bounded maximum degree appears as a spanning subdigraph of every directed graph on $n$ vertices with minimum semidegree at least $n/2+o(n)$. This can be seen as a directed graph…

A monotone drawing of a graph G is a straight-line drawing of G such that every pair of vertices is connected by a path that is monotone with respect to some direction. Trees, as a special class of graphs, have been the focus of several…

Let $A(\cdot)$ be an $(n+1)\times (n+1)$ uniformly elliptic matrix with H\"older continuous real coefficients and let $\mathcal E_A(x,y)$ be the fundamental solution of the PDE $\mathrm{div} A(\cdot) \nabla u =0$ in $\mathbb R^{n+1}$. Let…

We prove that, if $m$ is sufficiently large, every graph on $m+1$ vertices that has a universal vertex and minimum degree at least $\lfloor \frac{2m}{3} \rfloor$ contains each tree $T$ with $m$ edges as a subgraph. Our result confirms, for…

We study integral transforms mapping a function on the Euclidean space to the family of its integration on some hypersurfaces, that is, a function of hypersurfaces. The hypersurfaces are given by the graphs of functions with fixed axes of…

We present several results in extremal graph and hypergraph theory of topological nature. First, we show that if $\alpha>0$ and $\ell=\Omega(\frac{1}{\alpha}\log\frac{1}{\alpha})$ is an odd integer, then every graph $G$ with $n$ vertices…

We study reconstruction of an unknown function from its $d$-plane Radon transform on the flat $n$-torus when $1 \leq d \leq n-1$. We prove new reconstruction formulas and stability results with respect to weighted Bessel potential norms. We…

Geometry of networks endowed with a causal structure is discussed using the conventional framework of equilibrium statistical mechanics. The popular growing network models appear as particular causal models. We focus on a class of tree…

A topological space $G$ is said to be a {\it rectifiable space} provided that there are a surjective homeomorphism $\phi :G\times G\rightarrow G\times G$ and an element $e\in G$ such that $\pi_{1}\circ \phi =\pi_{1}$ and for every $x\in G$…