Related papers: Corona Decompositions for Parabolic Uniformly Rect…

In contrast with Kotzig's result that the line graph of a $3$-regular graph $X$ is Hamilton decomposable if and only if $X$ is Hamiltonian, we show that for each integer $k\geq 4$ there exists a simple non-Hamiltonian $k$-regular graph…

We show that under mild set theoretic hypotheses we have rigidity for algebras of continuous functions over Higson coronas, topological spaces arising in coarse geometry. In particular, we show that under $\mathsf{OCA}$ and $\mathsf…

In [M3], Milnor found Tricorn-like sets in the parameter space of real cubic polynomials. We give a rigorous definition of these Tricorn-like sets as suitable renormalization loci, and show that the dynamically natural straightening map…

A decoration of the Mandelbrot set $M$ is a part of $M$ cut off by two external rays landing at some tip of a satellite copy of $M$ attached to the main cardioid. In this paper we consider infinitely renormalizable quadratic polynomials…

An old conjecture of Ringel states that every tree with $m$ edges decomposes the complete graph $K_{2m+1}$. The best known lower bound for the order of a complete graph which admits a decomposition by every given tree with $m$ edges is…

A $(d,h)$-decomposition of a graph $G$ is an ordered pair $(D, H)$ such that $H$ is a subgraph of $G$ of maximum degree at most $h$ and $D$ is an acyclic orientation of $G-E(H)$ with maximum out-degree at most $d$. In this paper, we prove…

A {\em $(d,h)$-decomposition} of a graph $G$ is an order pair $(D,H)$ such that $H$ is a subgraph of $G$ where $H$ has the maximum degree at most $h$ and $D$ is an acyclic orientation of $G-E(H)$ of maximum out-degree at most $d$. A graph…

We provide a canonical decomposition for a class of bipartite grafts known as combs. As every bipartite graft is a recursive combination of combs, our results provides a canonical decomposition for general bipartite grafts. Our new…

We consider planar $\sigma$-harmonic mappings, that is mappings $U$ whose components $u^1$ and $u^2$ solve a divergence structure elliptic equation ${\rm div} (\sigma \nabla u^i)=0$, for $i=1,2$. We investigate whether a locally invertible…

We investigate the relationship between regular and decomposable Lagrangian cobordisms in $4$-dimensional symplectizations. First, we show that regular sliceness implies once-stably decomposable sliceness, and offer a stabilization-free…

We show that the resolution graph of a plane curve singularity admits a canonical decomposition into elementary graphs.

The graph reconstruction conjecture states that all graphs on at least three vertices are determined up to isomorphism by their deck. In this paper, a general framework for this problem is proposed to simply explain the reconstruction of…

Let $ \B^{n+1} \subset \C^{n+1}$ be the unit ball in a complex Euclidean space, and let $ \Sigma^n = \partial \B^{n+1} = S^{2n+1}$. Let $ f: \Sigma^n \hook \Sigma^{N}$ be a local CR immersion.If $ N-n<2n-1$, the asymptotic vectors of the…

We give a characterization of $L^{p}(\sigma)$ for uniformly rectifiable measures $\sigma$ using Tolsa's $\alpha$-numbers, by showing, for $1<p<\infty$ and $f\in L^{p}(\sigma)$, that \[ \lVert f\rVert_{L^{p}(\sigma)}\sim…

A simple graph $G$ is said to admit an antimagic orientation if there exist an orientation on the edges of $G$ and a bijection from $E(G)$ to $\{1,2,\ldots,|E(G)|\}$ such that the vertex sums of vertices are pairwise distinct, where the…

Let a group $\Gamma$ act on a paracompact, locally compact, Hausdorff space $M$ by homeomorphisms and let $2^M$ denote the set of closed subsets of $M$. We endow $2^M$ with the Chabauty topology, which is compact and admits a natural…

We present the converse to a higher dimensional, scale-invariant version of a classical theorem of F. and M. Riesz. More precisely, for $n\geq 2$, for an ADR domain $\Omega\subset \re^{n+1}$ which satisfies the Harnack Chain condition plus…

We study two decomposition problems in combinatorial geometry. The first part deals with the decomposition of multiple coverings of the plane. We say that a planar set is cover-decomposable if there is a constant m such that any m-fold…

The Ascending Subgraph Decomposition (ASD) Conjecture asserts that every graph $G$ with ${n+1\choose 2}$ edges admits an edge decomposition $G=H_1\oplus\cdots \oplus H_n$ such that $H_i$ has $i$ edges and it is isomorphic to a subgraph of…

We exhibit in the simple example of the Dunce's cap Feynman graph the structure of parametric renormalization on the level of integrands, and exhibit also the decomposition $\Phi^R=\Phi_{\mathrm{fin}}^{-1}(\Theta_0)\star…