An upper bound for the average number of regions
From MaRDI portal
Publication:1124599
Recommendations
- An upper bound on average touching number of a Voronoi partition
- scientific article; zbMATH DE number 7666855
- On the number of regions in an \(m\)-dimensional space cut by \(n\) hyperplanes
- Counting regions with bounded surface area
- Cubic graphs whose average number of regions is small
- Berry-{E}sseen bounds for the number of maxima in planar regions
- scientific article; zbMATH DE number 3893101
- Counting the regions in a regular drawing of \(K_{n,n}\)
- Region distributions of graph embeddings and Stirling numbers
- Discrete Region Competition for Unknown Numbers of Connected Regions
Cites work
Cited in
(9)- Stratified graphs for imbedding systems
- On the average genus of a graph
- Random 2-cell embeddings of multistars
- On the number of maximum genus embeddings of almost all graphs
- Bounds for the average genus of the vertex-amalgamation of graphs
- Cubic graphs whose average number of regions is small
- Expected number of faces in a random embedding of any graph is at most linear
- An Introduction to Random Topological Graph Theory
- Remarks on the lower bounds for the average genus
This page was built for publication: An upper bound for the average number of regions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1124599)