Some graphs with chromatic number three. - Jean A. Larson (J. Comb. Theory B, 1979)

Pairwise Balanced Designs Whose Line Sizes Do Not Divide Six. - David A. Drake; Jean A. Larson (J. Comb. Theory A, 1983)

The Number of One-Generated Cylindric Set Algebras of Dimension Greater than Two. - Jean A. Larson (J. Symb. Log., 1985)

A Diamond Example of an Ordinal Graph with No Infinite Paths. - James E. Baumgartner; Jean A. Larson (Ann. Pure Appl. Log., 1990)

Martin's Axiom and Ordinal Graphs: Large Independent Sets or Infinite Paths. - Jean A. Larson (Ann. Pure Appl. Log., 1990)

Matchings from a set below to a set above. - Paul Erdös; Jean A. Larson (Discret. Math., 1991)

The Nonexistence of Certain Projective Planes of Order 15. - David A. Drake; Jean A. Larson (Exp. Math., 1992)

Multicolored graphs on countable ordinals of finite exponent. - Carl Darby; Jean A. Larson (Set Theory: The Hajnal Conference, 1999)

An Ordinal Partition Avoiding Pentagrams. - Jean A. Larson (J. Symb. Log., 2000)

Ramsey Theory for Countable Binary Homogeneous Structures. - Jean A. Larson (Notre Dame J. Formal Log., 2005)

Partition relations on a plain product order type. - Jean A. Larson (Ann. Pure Appl. Log., 2006)

Counting canonical partitions in the random graph. - Jean A. Larson (Comb., 2008)

Partitions of large Rado graphs. - Mirna Dzamonja; Jean A. Larson; William J. Mitchell 002 (Arch. Math. Log., 2009)

The quasi order of graphs on an ordinal. - Péter Komjáth; Jean A. Larson; Norbert Sauer (Discret. Math., 2011)

Continuous Maps on Aronszajn Trees. - Kenneth Kunen; Jean A. Larson; Juris Steprans (Order, 2012)

Infinite Combinatorics. - Jean A. Larson (Sets and Extensions in the Twentieth Century, 2012)

In memoriam: James Earl Baumgartner (1943-2011). - Jean A. Larson (Arch. Math. Log., 2017)