8 citations · 15 across the 6 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
math.CO2021
The -coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size
Yanjia Li, Sophie Spirkl
Motivated by the analogous questions in graphs, we study the complexity of coloring and stable set problems in hypergraphs with forbidden substructures and bounded edge size. Letti…
math.CO2021★ 8 cited
Complexity dichotomy for List-5-Coloring with a forbidden induced subgraph
Sepehr Hajebi, Yanjia Li, Sophie Spirkl
For a positive integer and graphs and , we denote by the disjoint union of and , and by the union of mutually disjoint copies of . Also, we say…