- Anshul Adve, Colleen Robichaux, Alexander Yong, An efficient algorithm for deciding vanishing of Schubert polynomial coefficients, Advances in Math, Volume 383, 4 June 2021, 107669.
- József Balogh, Felix Christian Clemen, Emily Heath, Mikhail Lavrov, A strengthening of the Erdős-Szekeres theorem. European J. Combin. 101 (2022), Paper No. 103456.
- József Balogh, Michelle Delcourt, Emily Heath, Lina Li, Generalized rainbow Turán numbers of odd cycles, Discrete Math. 345 (2022), no. 2, Paper No. 112663, 4 pp.
- József Balogh, Sean English, Emily Heath, Robert A. Krueger, Lower bounds on the Erdős-Gyárfás problem via color energy graphs, submitted.
- József Balogh, Ramon I. Garcia, Michael C. Wigal, On the number of P-free set systems for tree posets P, Order, (2025) 1–13.
- József Balogh, Jialin He, Robert A. Krueger, The Nguyen, Michael C. Wigal, Clique covers and decompositions of cliques of graphs, submitted, 2024.
- József Balogh, Robert A. Krueger, Haoran Luo, Sharp threshold for the Erdős-Ko-Rado theorem, submitted.
- József Balogh, William Linz, Short proofs of two results about intersecting set systems, submitted.
- József Balogh, The Nguyen, Patric R. J. Östergård, Ethan Patrick White, Michael C. Wigal, Improving Uniquely Decodable Codes in Binary Adder Channels, submitted, 2023.
- József Balogh, Michael C. Wigal, Packing edge disjoint cliques in graphs, submitted, 2025.
- Richard Bi, Peter Bradshaw, Flexibility of graphs with maximum average degree less than 3, submitted, 2024.
- Richard Bi, Peter Bradshaw, Graphs of maximum average degree less than 11/3 are flexibly 4-choosable, submitted, 2024.
- Peter Bradshaw, Fractional colorings of partial t-trees with no large clique, Discrete Math. 348 (2025), no. 9, Paper No. 114495.
- Peter Bradshaw, Rainbow spanning trees in random subgraphs of dense regular graphs, Discrete Math. 347 (2024), no. 6, Paper No. 113960.
- Peter Bradshaw, Tianyue Cao, Atlas Chen, Braden Dean, Siyu Gan, Ramon I. Garcia, Amit Krishnaiyer, Grace McCourt, Arvind Murty, Chip games and multipartite graph paintability, submitted, 2024.
- Peter Bradshaw, Yaobin Chen, Hao Ma, Bojan Mohar, Hehui Wu, List Avoiding Orientations, Combinatorica (2024).
- Peter Bradshaw, Ilkyoo Choi, Alexandr Kostochka, Jingwei Xu, A lower bound on the number of edges in DP-critical graphs, submitted, 2024.
- Peter Bradshaw, Ilkyoo Choi, Alexandr Kostochka, Jingwei Xu, A lower bound on the number of edges in DP-critical graphs. II. Four colors, submitted, 2024.
- Peter Bradshaw, Alexander Clow, Ladislav Stacho, A cornering strategy for synchronizing a DFA, submitted 2024.
- Peter Bradshaw, Alexander Clow, Jingwei Xu, Injective edge colorings of degenerate graphs and the oriented chromatic number, European Journal of Combinatorics Volume 127, June 2025, 104139.
- Peter Bradshaw, Sergey Norin, Douglas West, Strong parity edge-colorings of graphs, submitted, 2025.
- Peter Bradshaw, Jinghan A Zeng, Paintability of r-chromatic graphs, Discrete Math. 348 (2025), no. 10, Paper No. 114558.
- David Brewster, Reuven Hodges, Alexander Yong, Proper permutations, Schubert geometry, and randomness, submitted, 2021.
- Shiliang Gao, Reuven Hodges, Gidon Orelowitz, Multiplicity-free skew Schur polynomials, submitted, 2021.
- Shiliang Gao, Gidon Orelowitz, Alexander Yong, Newell-Littlewood numbers, Transactions of the AMS, to appear, 2021.
- Shiliang Gao, Gidon Orelowitz, Alexander Yong, Newell-Littlewood numbers II: Extended Horn inequalities, submitted, 2021.
- Yibo Gao, Reuven Hodges, Alexander Yong, Classification of Levi-spherical Schubert varieties, submitted, 2021.
- Alexandr V. Kostochka, Grace McCourt, Mina Nahvi, On sizes of 1-cross intersecting set pair systems.
- Alexandr V. Kostochka, Mina Nahvi, Douglas B. West, Dara Zirlin, Acyclic graphs with at least 2ℓ+1 vertices are ℓ-recognizable.
- James A. Long Jr., Kevin G. Milans, Michael C. Wigal, Longest Path and Cycle Transversals in Chordal Graphs, submitted, 2025.
- Jorn van der Pol, Zach Walsh, Michael C. Wigal, Turán densities for matroid basis hypergraphs, submitted, 2025.
