𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An Improved Bound on the Number of Unit Area Triangles

✍ Scribed by Roel Apfelbaum; Micha Sharir

Book ID
106150034
Publisher
Springer
Year
2010
Tongue
English
Weight
334 KB
Volume
44
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An improved upper bound on the crossing
An improved upper bound on the crossing number of the hypercube
✍ Luerbio Faria; Celina Miraglia Herrera de Figueiredo; Ondrej SΓ½kora; Imrich Vrt' πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 288 KB

## Abstract We draw the __n__‐dimensional hypercube in the plane with ${5\over 32}4^{n}-\lfloor{{{{n}^{2}+1}\over 2}}\rfloor {2}^{n-2}$ crossings, which improves the previous best estimation and coincides with the long conjectured upper bound of ErdΓΆs and Guy. Β© 2008 Wiley Periodicals, Inc. J Graph

An improvement of the crossing number bo
An improvement of the crossing number bound
✍ Bernard Montaron πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 194 KB

## Abstract The crossing number __cr__(__G__) of a simple graph __G__ with __n__ vertices and __m__ edges is the minimum number of edge crossings over all drawings of __G__ on the ℝ^2^ plane. The conjecture made by ErdΕ‘s in 1973 that __cr__(__G__) β‰₯ __Cm__^3^/__n__^2^ was proved in 1982 by Leighton

An improved edge bound on the interval n
An improved edge bound on the interval number of a graph
✍ Jeremy R. Spinrad; G. Vijayan; Douglas B. West πŸ“‚ Article πŸ“… 1987 πŸ› John Wiley and Sons 🌐 English βš– 147 KB πŸ‘ 2 views

The upper bound on the interval number of a graph in terms of its number of edges is improved. Also, the interval number of graphs in hereditary classes is bounded in terms of the vertex degrees. A representation of a graph as an intersection graph assigns each vertex a set such that vertices are a