Clique minors in graphs with a forbidden subgraph

The classical Hadwiger conjecture dating back to 1940's states that any graph of chromatic number at least \(r\) has the clique of order \(r\) as a minor. Hadwiger's conjecture is an example of a well studied class of problems asking how large a clique minor one can guarantee in a graph wi...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2021-02
Hauptverfasser:	Bucić, M, Fox, J, Sudakov, B
Format:	Artikel
Sprache:	eng
Schlagworte:	Apexes Graph theory Graphs Questions
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!