An upper bound for the average number of regions
From MaRDI portal
Publication:1124599
DOI10.1016/0095-8956(91)90063-PzbMATH Open0679.05028MaRDI QIDQ1124599FDOQ1124599
Authors: Saul Stahl 
Publication date: 1991
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
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
upper boundmaximum genusaverage genusprobabilistic argumentorientable embeddingsarbitrary graphmean of the region distribution
Random graphs (graph-theoretic aspects) (05C80) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
Cited In (9)
- Random 2-cell embeddings of multistars
- An Introduction to Random Topological Graph Theory
- Stratified graphs for imbedding systems
- Cubic graphs whose average number of regions is small
- On the average genus of a graph
- Expected number of faces in a random embedding of any graph is at most linear
- Remarks on the lower bounds for the average genus
- Bounds for the average genus of the vertex-amalgamation of graphs
- On the number of maximum genus embeddings of almost all graphs
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)
