On critical nets in R^k
From MaRDI portal
Publication:2025656
Abstract: Critical nets in (sometimes called geodesic nets) are embedded graph with the property that their embedding is a critical point of the total (edge) length functional and under the constraint that certain 1-valent vertices (leaves) have a fixed position. In contrast to what happens on generic manifolds, we show that, if n is the number of 1-valent vertices, the total length of the edges not incident with a 1-valent vertex is bounded by rn (where r is the outer radius), the degree of any vertex is bounded by n and that the number of edges (and hence the number of vertices) is bounded by nl where l is related to the combinatorial diameter of the graph.
Recommendations
Cites work
- scientific article; zbMATH DE number 1943957 (Why is no real title available?)
- scientific article; zbMATH DE number 3264357 (Why is no real title available?)
- Geodesic nets on the 2-sphere
- Minimal webs in Riemannian manifolds
- On the maximum number of vertices of critically embedded graphs
- Singularities, expanders and topology of maps. I: Homology versus volume in the spaces of cycles
- The structure of stationary one dimensional varifolds with positive density
Cited in
(7)- On the maximum number of vertices of critically embedded graphs
- Translations of nets and relationship between supreme and \(L^ \kappa\)-discrepancies
- Example of a nontrivial irreducible geodesic net in the plane
- scientific article; zbMATH DE number 3842635 (Why is no real title available?)
- Minimizing geodesic nets and critical points of distance
- Flowers on Riemannian manifolds
- scientific article; zbMATH DE number 2061155 (Why is no real title available?)
This page was built for publication: On critical nets in \({\mathbb{R}}^k\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2025656)