Generalizations of the Crossing Lemma
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916954838663168 |
|---|---|
| author | Toth, Geza |
| author_facet | Toth, Geza |
| contents | The crossing number of a graph is the minimum number of crossings over all of its drawings on the plane. The Crossing Lemma, proved more than 40 years ago, is a tight lower bound on the crossing number of a graph in terms of the number of vertices and edges. It is definitely the most important inequality on crossing numbers. We review some generalizations and applications of the Crossing Lemma. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_14074 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Generalizations of the Crossing Lemma Toth, Geza Combinatorics The crossing number of a graph is the minimum number of crossings over all of its drawings on the plane. The Crossing Lemma, proved more than 40 years ago, is a tight lower bound on the crossing number of a graph in terms of the number of vertices and edges. It is definitely the most important inequality on crossing numbers. We review some generalizations and applications of the Crossing Lemma. |
| title | Generalizations of the Crossing Lemma |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2509.14074 |