English
Related papers

Related papers: Rigidity, graphs and Hausdorff dimension

200 papers

By definition, a rigid graph in $\mathbb{R}^d$ (or on a sphere) has a finite number of embeddings up to rigid motions for a given set of edge length constraints. These embeddings are related to the real solutions of an algebraic system.…

Combinatorics · Mathematics 2021-10-26 Evangelos Bartzos , Ioannis Z. Emiris , Raimundas Vidunas

Given a bipartite graph $G$, the graphical matrix space $\mathcal{S}_G$ consists of matrices whose non-zero entries can only be at those positions corresponding to edges in $G$. Tutte (J. London Math. Soc., 1947), Edmonds (J. Res. Nat. Bur.…

Combinatorics · Mathematics 2022-06-13 Yinan Li , Youming Qiao , Avi Wigderson , Yuval Wigderson , Chuanqi Zhang

Highly connected and yet sparse graphs (such as expanders or graphs of high treewidth) are fundamental, widely applicable and extensively studied combinatorial objects. We initiate the study of such highly connected graphs that are, in…

Computational Geometry · Computer Science 2013-06-17 Prosenjit Bose , Vida Dujmovic , Pat Morin , Michiel Smid

The graph is one of the most widely used mathematical structures in engineering and science because of its representational power and inherent ability to demonstrate the relationship between objects. The objective of this work is to…

Data Structures and Algorithms · Computer Science 2021-01-01 Shri Prakash Dwivedi

A graph $G=(V,E)$ with geodesic distance $d(\cdot,\cdot)$ is said to be resolved by a non-empty subset $R$ of its vertices when, for all vertices $u$ and $v$, if $d(u,r)=d(v,r)$ for each $r\in R$, then $u=v$. The metric dimension of $G$ is…

Combinatorics · Mathematics 2021-06-29 Richard C. Tillquist , Rafael M. Frongillo , Manuel E. Lladser

A set of vertices $S$ resolves a graph if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The metric dimension of a graph is the minimum cardinality of a resolving set of the graph. Fix a connected…

Combinatorics · Mathematics 2019-03-21 Zilin Jiang , Nikita Polyanskii

Let $\kappa'(G)$, $\kappa(G)$, $\mu_{n-1}(G)$ and $\mu_1(G)$ denote the edge-connectivity, vertex-connectivity, the algebraic connectivity and the Laplacian spectral radius of $G$, respectively. In this paper, we prove that for integers…

Combinatorics · Mathematics 2020-01-06 Zhen-Mu Hong , Hong-Jian Lai , Zheng-Jiang Xia

The classical Hausdorff dimension of finite or countable metric spaces is zero. Recently, we defined a variant, called \emph{finite Hausdorff dimension}, which is not necessarily trivial on finite metric spaces. In this paper we apply this…

Combinatorics · Mathematics 2016-07-28 Juan M. Alonso

For a given graph $H$, its subdivisions carry the same topological structure. The existence of $H$-subdivisions within a graph $G$ has deep connections with topological, structural and extremal properties of $G$. One prominent example of…

Combinatorics · Mathematics 2023-08-22 Seonghyuk Im , Jaehoon Kim , Younjin Kim , Hong Liu

In this paper, we discuss automorphism related parameters of a graph associated to a finite vector space. The fixing neighborhood of a pair $(u,v)$ of vertices of a graph $G$ is the set of all those vertices $w$ of $G$, such that the orbits…

Combinatorics · Mathematics 2018-05-31 Hira Benish , Imran Javaid , M. Murtaza

A set of vertices $S$ \emph{resolves} a connected graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The \emph{metric dimension} of $G$ is the minimum cardinality of a resolving set of $G$.…

Combinatorics · Mathematics 2012-05-21 Carmen Hernando , Merce Mora , Ignacio M. Pelayo , Carlos Seara , David R. Wood

Let $G$ be a connected graph and $\ell : E(G) \to \mathbb{R}^+$ a length-function on the edges of $G$. The Steiner distance $\mathrm{sd}_G(A)$ of $A \subseteq V(G)$ within $G$ is the minimum length of a connected subgraph of $G$ containing…

Combinatorics · Mathematics 2017-03-30 Daniel Weißauer

We prove that for all $s\in(0,d)$ and $c\in (0,1)$ there exists a self-similar set $E\subset \mathbb{R}^d$ with Hausdorff dimension $s$ such that $\mathcal{H}^s(E)=c|E|^s$. This answers a question raised by Zhiying Wen[16].

Classical Analysis and ODEs · Mathematics 2022-01-07 Cai-Yun Ma , Yu-Feng Wu

Let $G=(V, E)$ be a connected graph. Given a vertex $v\in V$ and an edge $e=uw\in E$, the distance between $v$ and $e$ is defined as $d_G(e,v)=\min\{d_G(u,v),d_G(w,v)\}$. A nonempty set $S\subset V$ is an edge metric generator for $G$ if…

Combinatorics · Mathematics 2018-09-25 Iztok Peterin , Ismael G. Yero

Let $\ell_1,\ell_2,\dots$ be a countable collection of lines in ${\mathbb R}^d$. For any $t \in [0,1]$ we construct a compact set $\Gamma\subset{\mathbb R}^d$ with Hausdorff dimension $d-1+t$ which projects injectively into each $\ell_i$,…

Metric Geometry · Mathematics 2021-08-25 Frank Coen , Nate Gillman , Tamás Keleti , Dylan King , Jennifer Zhu

We study the following rainbow version of subgraph containment problems in a family of (hyper)graphs, which generalizes the classical subgraph containment problems in a single host graph. For a collection $\textbf{G}=\{G_1, G_2,\ldots,…

Combinatorics · Mathematics 2023-10-05 Yangyang Cheng , Jie Han , Bin Wang , Guanghui Wang

A graph $G$ is $\textit{universal}$ for a (finite) family $\mathcal{H}$ of graphs if every $H \in \mathcal{H}$ is a subgraph of $G$. For a given family $\mathcal{H}$, the goal is to determine the smallest number of edges an…

Combinatorics · Mathematics 2024-01-12 Noga Alon , Natalie Dodson , Carmen Jackson , Rose McCarty , Rajko Nenadov , Lani Southern

We study sequences of oriented Riemannian manifolds with boundary and, more generally, integral current spaces and metric spaces with boundary. {\color{blue}For a metric space, we define its boundary to be the completion of the space minus…

Metric Geometry · Mathematics 2021-08-18 Raquel Perales

We prove that if the Hausdorff dimension of $E \subset {\Bbb R}^d$, $d \ge 3$, is greater than $\min \left\{ \frac{dk+1}{k+1}, \frac{d+k}{2} \right\},$ then the ${k+1 \choose 2}$-dimensional Lebesgue measure of $T_k(E)$, the set of…

Classical Analysis and ODEs · Mathematics 2016-08-18 Allan Greenleaf , Alex Iosevich , Bochen Liu , Eyvindur Palsson

We say that $E$ is a microset of the compact set $K\subset \mathbb{R}^d$ if there exist sequences $\lambda_n\geq 1$ and $u_n\in \mathbb{R}^d$ such that $(\lambda_n K + u_n ) \cap [0,1]^d$ converges to $E$ in the Hausdorff metric, and…

Classical Analysis and ODEs · Mathematics 2021-04-21 Richárd Balka , Márton Elekes , Viktor Kiss
‹ Prev 1 8 9 10 Next ›