Publications

Journal: ELECTRONIC JOURNAL OF COMBINATORICS

Number of publications: 9

2024

• Shuo Li, Jakub Pachocki, Jakub Radoszewski , A Note on the Maximum Number of k-Powers in a Finite Word, ELECTRONIC JOURNAL OF COMBINATORICS, 31 (3) 2024, p. 1-10. See in PBN

2023

• Linda Cook, Tomáš Masařík , Marcin Pilipczuk , Amadeus Reinald, Uéverton Dos Santos Souza, Proving a Directed Analogue of the Gyárfás-Sumner Conjecture for Orientations of $P_4$, ELECTRONIC JOURNAL OF COMBINATORICS, 30 (3) 2023, p. 1-27. See in PBN

2022

• Wojciech Nadara , Marcin Smulewicz, Decreasing the Maximum Average Degree by Deleting an Independent Set or a $d$-Degenerate Subgraph, ELECTRONIC JOURNAL OF COMBINATORICS, 29 (1) 2022. See in PBN
• Sean English, Tomáš Masařík , Grace McCourt, Erin Meger, Michael S. Ross, Sam Spiro, Linear Bounds for Cycle-Free Saturation Games, ELECTRONIC JOURNAL OF COMBINATORICS, 29 (3) 2022, p. 5:1-5:21. See in PBN

2021

• Andrzej Grzesik, Tereza Klimošová, Marcin Pilipczuk , Michał Pilipczuk , Covering minimal separators andpotential maximal cliques in $P_{t}$-free graphs, ELECTRONIC JOURNAL OF COMBINATORICS, 28 (1) 2021. See in PBN
• Marthe Bonamy, François Dross, Tomáš Masařík , Andrea Munaro, Wojciech Nadara , Marcin Pilipczuk , Michał Pilipczuk , Jones' Conjecture in Subcubic Graphs, ELECTRONIC JOURNAL OF COMBINATORICS, 28 (4) 2021, p. P4.5: 1-12. See in PBN

2018

• Krzysztof Choromanski, Dvir Falik, Anita Liebenau, Viresh Patel, Marcin Pilipczuk , Excluding Hooks and their Complements, ELECTRONIC JOURNAL OF COMBINATORICS, 25 (3) 2018, p. P3.27:1 - P3.27: 33. See in PBN

2016

• Michał Pilipczuk , Szymon Toruńczyk , On Ultralimits of Sparse Graph Classes, ELECTRONIC JOURNAL OF COMBINATORICS, 23 (2) 2016, p. P2.32. See in PBN

2013

• Paweł Baturo, Marcin Piątkowski, Wojciech Rytter , The maximal number of runs in standard Sturmian words., ELECTRONIC JOURNAL OF COMBINATORICS, 20 (1) 2013, p. P13-1-21. See in PBN