Indicated coloring of graphs. - Andrzej Grzesik (Discret. Math., 2012)

On the maximum number of five-cycles in a triangle-free graph. - Andrzej Grzesik (J. Comb. Theory B, 2012)

Interval edge-colorings of K_{1, m, n}. - Andrzej Grzesik; Hrant Khachatrian (CoRR, 2013)

Interval edge-colorings of K1, m, n. - Andrzej Grzesik; Hrant Khachatrian (Discret. Appl. Math., 2014)

Avoider-Enforcer star games. - Andrzej Grzesik; Mirjana Mikalacki; Zoltán Lóránt Nagy; Alon Naor; Balázs Patkós; Fiona Skerman (Discret. Math. Theor. Comput. Sci., 2015)

Finitely forcible graphons and permutons. - Roman Glebov; Andrzej Grzesik; Tereza Klimosová; Daniel Král (J. Comb. Theory B, 2015)

From Directed Path to Linear Order - The Best Choice Problem for Powers of Directed Path. - Andrzej Grzesik; Michal Morayne; Malgorzata Sulkowska (SIAM J. Discret. Math., 2015)

On the Caccetta-Häggkvist Conjecture with a Forbidden Transitive Tournament. - Andrzej Grzesik (Electron. J. Comb., 2017)

Polynomial-time algorithm for Maximum Weight Independent Set on $P_6$-free graphs. - Andrzej Grzesik; Tereza Klimosová; Marcin Pilipczuk; Michal Pilipczuk (CoRR, 2017)

Extremal graph theory and finite forcibility. - Andrzej Grzesik; Daniel Král'; László Miklós Lovász (Electron. Notes Discret. Math., 2017)

Elusive extremal graphs. - Andrzej Grzesik; Daniel Král'; László Miklós Lovász (CoRR, 2018)

Optimal-size clique transversals in chordal graphs. - Jacob W. Cooper; Andrzej Grzesik; Daniel Král' (J. Graph Theory, 2018)

Analytic representations of large graphs. - Andrzej Grzesik; Daniel Král (BCC, 2019)

Polynomial-time algorithm for Maximum Weight Independent Set on P6-free graphs. - Andrzej Grzesik; Tereza Klimosová; Marcin Pilipczuk; Michal Pilipczuk (SODA, 2019)

Minimum number of edges that occur in odd cycles. - Andrzej Grzesik; Ping Hu 004; Jan Volec (J. Comb. Theory B, 2019)

Covering minimal separators and potential maximal cliques in Pt-free graphs. - Andrzej Grzesik; Tereza Klimosová; Marcin Pilipczuk; Michal Pilipczuk (CoRR, 2020)

Cycles of length three and four in tournaments. - Timothy F. N. Chan; Andrzej Grzesik; Daniel Král'; Jonathan A. Noel (J. Comb. Theory A, 2020)

Covering Minimal Separators and Potential Maximal Cliques in $P_t$-Free Graphs. - Andrzej Grzesik; Tereza Klimosová; Marcin Pilipczuk; Michal Pilipczuk (Electron. J. Comb., 2021)

Exact hyperplane covers for subsets of the hypercube. - James Aaronson; Carla Groenland; Andrzej Grzesik; Tom Johnston; Bartlomiej Kielak (Discret. Math., 2021)

On tripartite common graphs. - Andrzej Grzesik; Joonkyung Lee; Bernard Lidický; Jan Volec (Comb. Probab. Comput., 2022)

On the inducibility of oriented graphs on four vertices. - Lukasz Bozyk; Andrzej Grzesik; Bartlomiej Kielak (Discret. Math., 2022)

Tuza's Conjecture for Threshold Graphs. - Marthe Bonamy; Lukasz Bozyk; Andrzej Grzesik; Meike Hatzel; Tomás Masarík; Jana Novotná 001; Karolina Okrasa (Discret. Math. Theor. Comput. Sci., 2022)

Packing and covering directed triangles asymptotically. - Jacob W. Cooper; Andrzej Grzesik; Adam Kabela; Daniel Král' (Eur. J. Comb., 2022)

The Turán number of blow-ups of trees. - Andrzej Grzesik; Oliver Janzer; Zoltán Lóránt Nagy (J. Comb. Theory B, 2022)

The maximum number of paths of length three in a planar graph. - Andrzej Grzesik; Ervin Györi; Addisu Paulos; Nika Salia; Casey Tompkins; Oscar Zamora 001 (J. Graph Theory, 2022)

On the maximum number of odd cycles in graphs without smaller odd cycles. - Andrzej Grzesik; Bartlomiej Kielak (J. Graph Theory, 2022)

Polynomial-time Algorithm for Maximum Weight Independent Set on P6-free Graphs. - Andrzej Grzesik; Tereza Klimosová; Marcin Pilipczuk; Michal Pilipczuk (ACM Trans. Algorithms, 2022)

Subgraph Densities in $K_r$-Free Graphs. - Andrzej Grzesik; Ervin Györi; Nika Salia; Casey Tompkins (Electron. J. Comb., 2023)

Cycles of a given length in tournaments. - Andrzej Grzesik; Daniel Král'; László Miklós Lovász; Jan Volec (J. Comb. Theory B, 2023)

Quasirandom-Forcing Orientations of Cycles. - Andrzej Grzesik; Daniel Il'kovic; Bartlomiej Kielak; Daniel Král' (SIAM J. Discret. Math., 2023)

Directed Graphs Without Rainbow Stars. - Dániel Gerbner; Andrzej Grzesik; Cory Palmer; Magdalena Prorok (Electron. J. Comb., 2024)

On Triangle-Free Graphs Maximizing Embeddings of Bipartite Graphs. - Dmitriy Gorovoy; Andrzej Grzesik; Justyna Jaworska (Electron. J. Comb., 2024)

The double Hall property and cycle covers in bipartite graphs. - János Barát; Andrzej Grzesik; Attila Jung; Zoltán Lóránt Nagy; Dömötör Pálvölgyi (Discret. Math., 2024)

Forcing generalised quasirandom graphs efficiently. - Andrzej Grzesik; Daniel Král'; Oleg Pikhurko (Comb. Probab. Comput., 2024)

Maximal edge colorings of graphs. - Sebastian Babinski; Andrzej Grzesik (Eur. J. Comb., 2024)

Graphs without a Rainbow Path of Length 3. - Sebastian Babinski; Andrzej Grzesik (SIAM J. Discret. Math., 2024)