Long paths and cycles in subgraphs of the cube. - Eoin Long (Comb., 2013)

Random Walks on Quasirandom Graphs. - Ben Barber; Eoin Long (Electron. J. Comb., 2013)

Frankl-Rödl type theorems for codes and permutations. - Peter Keevash; Eoin Long (CoRR, 2014)

Tilted Sperner families. - Imre Leader; Eoin Long (Discret. Appl. Math., 2014)

Forbidding a set difference of size 1. - Imre Leader; Eoin Long (Discret. Appl. Math., 2014)

Long geodesics in subgraphs of the cube. - Imre Leader; Eoin Long (Discret. Math., 2014)

Packing, Counting and Covering Hamilton cycles in random directed graphs. - Asaf Ferber; Gal Kronenberg; Eoin Long (Electron. Notes Discret. Math., 2015)

Large unavoidable subtournaments. - Eoin Long (Electron. Notes Discret. Math., 2015)

Forbidding intersection patterns between layers of the cube. - Eoin Long (J. Comb. Theory A, 2015)

On the Normalized Shannon Capacity of a Union. - Peter Keevash; Eoin Long (Comb. Probab. Comput., 2016)

Set families with a forbidden pattern. - Ilan Karpas; Eoin Long (Eur. J. Comb., 2017)

A stability result for the cube edge isoperimetric inequality. - Peter Keevash; Eoin Long (J. Comb. Theory A, 2018)

Packing and counting arbitrary Hamilton cycles in random digraphs. - Asaf Ferber; Eoin Long (Random Struct. Algorithms, 2019)

Correlation for permutations. - J. Robert Johnson; Imre Leader; Eoin Long (J. Comb. Theory A, 2020)

Stability for vertex isoperimetry in the cube. - Peter Keevash; Eoin Long (J. Comb. Theory B, 2020)

Tournament Quasirandomness from Local Counting. - Matija Bucic; Eoin Long; Asaf Shapira; Benny Sudakov (Comb., 2021)

Distinct degrees and homogeneous sets. - Eoin Long; Laurentiu Ploscaru (J. Comb. Theory B, 2023)

A bipartite version of the Erdős-McKay conjecture. - Eoin Long; Laurentiu Ploscaru (Comb. Probab. Comput., 2023)

Turán Problems for Expanded Hypergraphs. - Peter Keevash; Noam Lifshitz; Eoin Long; Dor Minzer (Comb., 2025)