Related papers: Maximize the Steklov eigenvalue of trees
In their paper, Bounds on the Number of Edges in Hypertrees, G.Y. Katona and P.G.N. Szab\'o introduced a new, natural definition of hypertrees in $k$-uniform hypergraphs and gave lower and upper bounds on the number of edges. They also…
The $k$-expansion of a graph $G$ is the $k$-uniform hypergraph obtained from $G$ by adding $k-2$ new vertices to every edge. We determine, for all $k > d \geq 1$, asymptotically optimal $d$-degree conditions that ensure the existence of all…
Given a graph $G=(V,E)$ with non-negative real edge lengths and an integer parameter $k$, the Min-Max k-Tree Cover problem seeks to find a set of at most $k$ subtrees of $G$, such that the union of the trees is the vertex set $V$. The…
We introduce a graph $\Gamma$ which is roughly isometric to the hyperbolic plane and we study the Steklov eigenvalues of a subgraph with boundary $\Omega$ of $\Gamma$. For $(\Omega_l)_{l\geq 1}$ a sequence of subraphs of $\Gamma$ such that…
A \emph{tree-partition} of a graph $G$ is a proper partition of its vertex set into `bags', such that identifying the vertices in each bag produces a forest. The \emph{tree-partition-width} of $G$ is the minimum number of vertices in a bag…
We consider Steklov eigenvalues of nearly circular domains in $\R^{2}$ of fixed unitary area. In \cite{viator2018}, the authors treated such domains as perturbations of the disk, and they computed the first-order term of the asymptotic…
It follows from a classical result of Jordan that every tree with maximum degree at most $r$ containing a vertex set labeled by $[n]$, has a single-edge cut which separates two subsets $A,B \subset [n]$ for which $\min\{|A|,|B|\} \ge…
A $(1+\varepsilon)\textit{-stretch tree cover}$ of a metric space is a collection of trees, where every pair of points has a $(1+\varepsilon)$-stretch path in one of the trees. The celebrated $\textit{Dumbbell Theorem}$ [Arya et~al.…
In this short note, we show the rigidity of a trace estimate for Steklov eigenvalues with respect to functions in our previous work (Trace and inverse trace of Steklov eigenvalues. J. Differential Equations 261 (2016), no. 3, 2026--2040.).…
We prove Reilly-type upper bounds for divergence-type operators of the second order as well as for Steklov problems on submanifolds of Riemannian manifolds of bounded sectional curvature endowed with a weighted measure.
$K_\sigma$ sets involving sticky maps $\sigma$ have been used in the theory of differentiation of integrals to probabilistically construct Kakeya-type sets that imply certain types of directional maximal operators are unbounded on…
Let $\mu(G)$ denote the spectral radius of a graph $G$. We partly confirm a conjecture due to Nikiforov, which is a spectral radius analogue of the well-known Erd\H{o}s-S\'os Conjecture that any tree of order $t$ is contained in a graph of…
We determine the sharp threshold for the containment of all $n$-vertex trees of bounded degree in random geometric graphs with $n$ vertices. This provides a geometric counterpart of Montgomery's threshold result for binomial random graphs,…
We present upper and lower bounds for Steklov eigenvalues for domains in $\mathbb{R}^{N+1}$ with $C^2$ boundary compatible with the Weyl asymptotics. In particular, we obtain sharp upper bounds on Riesz-means and the trace of corresponding…
A classical result of Koml\'os, S\'ark\"ozy and Szemer\'edi shows that every large $n$-vertex graph with minimum degree at least $(1/2+\gamma)n$ contains all spanning trees of bounded degree. We generalised this result to loose spanning…
We investigate the validity of the optimal higher-order Sobolev inequality $H_k^2(M^n)\hookrightarrow L^{\frac{2n}{n-2k}}(M^n)$ on a closed Riemannian manifold when the remainder term is the $L^2-$norm. Unlike the case $k=1$, the optimal…
We consider a class of infinite weighted metric trees obtained as perturbations of self-similar regular trees. Possible definitions of the boundary traces of functions in the Sobolev space on such a structure are discussed by using…
The Wiener index is maximized over the set of trees with the given vertex weight and degree sequences. This model covers the traditional "unweighed" Wiener index, the terminal Wiener index, and the vertex distance index. It is shown that…
In this paper we revisit an approach pioneered by Auchmuty to approximate solutions of the Laplace- Robin boundary value problem. We demonstrate the efficacy of this approach on a large class of non-tensorial domains, in contrast with other…
We investigate the relationship between the Neumann and Steklov principal eigenvalues emerging from the study of collapsing convex domains in $\mathbb{R}^2$. Such a relationship allows us to give a partial proof of a conjecture concerning…