crossing number inequality (Q24896206)
Jump to navigation
Jump to search
theorem providing a lower bound to the crossing number; for sufficiently large graphs, the crossing number is not less than a constant times the cube of the number of edges divided by the square of the number of vertices
Language | Label | Description | Also known as |
---|---|---|---|
English | crossing number inequality |
theorem providing a lower bound to the crossing number; for sufficiently large graphs, the crossing number is not less than a constant times the cube of the number of edges divided by the square of the number of vertices |
Statements
Identifiers
Sitelinks
Wikipedia(4 entries)
- enwiki Crossing number inequality
- ruwiki Неравенство числа пересечений
- ukwiki Нерівність числа схрещень
- zhwiki 交叉數不等式