1 citations · 1 across the 1 of their papers we have counts for
4 papers
Polynomial-time recognition and maximum independent set in Burling graphs
PaweÅ RzÄ Å¼ewski, Bartosz Walczak
A Burling graph is an induced subgraph of some graph in Burling's construction of triangle-free high-chromatic graphs. Equivalently, a Burling graph is a graph that admits a so-cal…
QPTAS for MWIS and finding large sparse induced subgraphs in graphs with few independent long holes
Ãdouard Bonnet, Jadwiga Czyżewska, Tomáš MasaÅÃk +2
We present a quasipolynomial-time approximation scheme (QPTAS) for the Maximum Independent Set (\textsc{MWIS}) in graphs with a bounded number of pairwise vertex-disjoint and non-a…
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 intersect…
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…