2 papers
math.CO2020
Erdős-Hajnal properties for powers of sparse graphs
Marcin Briański, Piotr Micek, Michał Pilipczuk +1
We prove that for every nowhere dense class of graphs , positive integer , and , the following holds: in every -vertex graph from $\mathcal{C}…
math.CO2019
Improved bound for the dimension of posets of treewidth two
Michał T. Seweryn
Joret et al. proved that posets with cover graphs of treewidth at most 2 have dimension at most 1276. Their proof is long and very complex. We give a short and much simpler proof t…