Lower Bounds for the Isoperimetric Numbers of Random Regular Graphs. - Brett Kolesnik; Nick Wormald (SIAM J. Discret. Math., 2014)

Randomized sequential importance sampling for estimating the number of perfect matchings in bipartite graphs. - Persi Diaconis; Brett Kolesnik (Adv. Appl. Math., 2021)

Large deviations of the greedy independent set algorithm on sparse random graphs. - Brett Kolesnik (Random Struct. Algorithms, 2022)

The Asymptotic Number of Score Sequences. - Brett Kolesnik (Comb., 2023)

Weakly saturated random graphs. - Zsolt Bartha; Brett Kolesnik (Random Struct. Algorithms, 2024)

The Geometry of Random Tournaments. - Brett Kolesnik; Mario Sanchez (Discret. Comput. Geom., 2024)