On the Maximum Number of Vertices of Minimal Embedded Graphs

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

20 pages, 25 figures

Scientific paper

Consider graphs embedded in a Riemannian manifold, attached at $n$ fixed
points. Say such a graph is minimal if it is a critical point of the length
functional. In this paper, we give a sharp upper bound for the maximal number
of vertices of planar 3-regular minimal graphs.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

On the Maximum Number of Vertices of Minimal Embedded Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Maximum Number of Vertices of Minimal Embedded Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Maximum Number of Vertices of Minimal Embedded Graphs will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-18337

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.