A survey of degree-boundedness
Combinatorics
2024-11-14 v2
Abstract
Suppose a graph has no large balanced bicliques, but has large minimum degree. Then what can we say about its induced subgraphs? This question motivates the study of degree-boundedness, which is like -boundedness but for minimum degree instead of chromatic number. We survey this area with an eye towards open problems.
Keywords
Cite
@article{arxiv.2403.05737,
title = {A survey of degree-boundedness},
author = {Xiying Du and Rose McCarty},
journal= {arXiv preprint arXiv:2403.05737},
year = {2024}
}