Another Small but Long Step for Crossing Numbers: cr(13) = 225 and cr(14) = 315

Oswin Aichholzer

Another Small but Long Step for Crossing Numbers: cr(13) = 225 and cr(14) = 315

Institut für Softwaretechnologie (7160)

Publikation: Beitrag in Buch/Bericht/Konferenzband › Beitrag in einem Konferenzband › Begutachtung

Abstract

In this paper we consider the crossing number of simple drawings of complete graphs. Following the iterative enumeration approach developed in [3] we report on a
heavily computer assisted proof that the crossing number of the complete graph K13 is cr(13) = 225. This implies that cr(14) = 315

Originalsprache	englisch
Titel	Proceedings of the 33rd Canadian Conference on Computational Geometry (CCCG 2021)
Seiten	72-77
Seitenumfang	6
Publikationsstatus	Veröffentlicht - 2021
Veranstaltung	33rd Canadian Conference on Computational Geometry: CCCG 2021 - Virtuell, Kanada Dauer: 10 Aug. 2021 → 12 Aug. 2021

Konferenz

Konferenz	33rd Canadian Conference on Computational Geometry
Kurztitel	CCCG 2021
Land/Gebiet	Kanada
Ort	Virtuell
Zeitraum	10/08/21 → 12/08/21

Zugriff auf Dokument

https://projects.cs.dal.ca/cccg2021/proceedings/Lizenz: Andere

Dieses zitieren

@inproceedings{9e7646755e2e4768a15f01ce62b11b78,

title = "Another Small but Long Step for Crossing Numbers: cr(13) = 225 and cr(14) = 315",

abstract = "In this paper we consider the crossing number of simple drawings of complete graphs. Following the iterative enumeration approach developed in [3] we report on aheavily computer assisted proof that the crossing number of the complete graph K13 is cr(13) = 225. This implies that cr(14) = 315",

author = "Oswin Aichholzer",

year = "2021",

language = "English",

pages = "72--77",

booktitle = "Proceedings of the 33rd Canadian Conference on Computational Geometry (CCCG 2021)",

note = "33rd Canadian Conference on Computational Geometry : CCCG 2021, CCCG 2021 ; Conference date: 10-08-2021 Through 12-08-2021",

}

TY - GEN

T1 - Another Small but Long Step for Crossing Numbers: cr(13) = 225 and cr(14) = 315

AU - Aichholzer, Oswin

PY - 2021

Y1 - 2021

N2 - In this paper we consider the crossing number of simple drawings of complete graphs. Following the iterative enumeration approach developed in [3] we report on aheavily computer assisted proof that the crossing number of the complete graph K13 is cr(13) = 225. This implies that cr(14) = 315

AB - In this paper we consider the crossing number of simple drawings of complete graphs. Following the iterative enumeration approach developed in [3] we report on aheavily computer assisted proof that the crossing number of the complete graph K13 is cr(13) = 225. This implies that cr(14) = 315

M3 - Conference paper

SP - 72

EP - 77

BT - Proceedings of the 33rd Canadian Conference on Computational Geometry (CCCG 2021)

T2 - 33rd Canadian Conference on Computational Geometry

Y2 - 10 August 2021 through 12 August 2021

ER -