1 citations · 1 across the 2 of their papers we have counts for
3 papers
math.CO2025★ 1 cited
Burling graphs in graphs with large chromatic number
Tara Abrishami, Marcin Briański, James Davies +4
A graph class is -bounded if the only way to force large chromatic number in graphs from the class is by forming a large clique. In the 1970s, Erdős conjectured that intersectio…
cs.LO2025
Tabular intermediate logics comparison
Paweł Rzążewski, Michał Stronkowski
Tabular intermediate logics are intermediate logics characterized by finite posets treated as Kripke frames. For a poset , let denote the corresponding…
cs.DS2024
An -Approximation Algorithm for Vertex Cover on String Graphs
Édouard Bonnet, Paweł Rzążewski
We present a 1.8334-approximation algorithm for Vertex Cover on string graphs given with a representation, which takes polynomial time in the size of the representation; the exact…