3 papers
cs.CC2025
Constricting the Computational Complexity Gap of the -Coloring Problem in -free Graphs
Justyna Jaworska, Bartłomiej Kielak, Tomáš Masařík +1
The -Coloring problem on hereditary graph classes has been a deeply researched problem over the last decade. A hereditary graph class is characterized by a (possibly infinite) l…
math.CO2025
Generalized Turán problem for directed cycles
Andrzej Grzesik, Justyna Jaworska, Bartłomiej Kielak +2
For integers , let denote the maximum number of directed cycles of length in any oriented graph…
math.CO2023
On triangle-free graphs maximizing embeddings of bipartite graphs
Dmitriy Gorovoy, Andrzej Grzesik, Justyna Jaworska
In 1991 Gy\H ori, Pach, and Simonovits proved that for any bipartite graph containing a matching avoiding at most 1 vertex, the maximum number of copies of in any large eno…