Decomposing Graphs into Edges and Triangles. - Daniel Král'; Bernard Lidický; Taísa L. Martins; Yanitsa Pehova (Comb. Probab. Comput., 2019)

An approximate version of Jackson's conjecture. - Anita Liebenau; Yanitsa Pehova (Comb. Probab. Comput., 2020)

Characterization of quasirandom permutations by a pattern sum. - Timothy F. N. Chan; Daniel Král'; Jonathan A. Noel; Yanitsa Pehova; Maryam Sharifzadeh; Jan Volec (Random Struct. Algorithms, 2020)

On a Ramsey-Turán Variant of the Hajnal-Szemerédi Theorem. - Rajko Nenadov; Yanitsa Pehova (SIAM J. Discret. Math., 2020)

Sharp bounds for decomposing graphs into edges and triangles. - Adam Blumenthal; Bernard Lidický; Yanitsa Pehova; Florian Pfender; Oleg Pikhurko; Jan Volec (Comb. Probab. Comput., 2021)

Embedding loose spanning trees in 3-uniform hypergraphs. - Yanitsa Pehova; Kalina Petrova (J. Comb. Theory B, 2024)