The Australasian Journal of Combinatorics

Volume 86 (2023)

• Part 1

  ---

• Matthew DeVilbiss, Bradley Fain, Amber Holmes, Paul Horn, Sonwabile Mafunda and K.E. Perry
  • An extremal problem on rainbow spanning trees in graphs, pp.1–23

  ---

• Jean-Christophe Aval, Adrien Boussicault, Mathilde Bouvel, Olivier Guibert and Matteo Silimbani
  • Baxter tree-like tableaux, pp.24–75

  ---

• Lorenzo Federico
  • Almost-$2$-regular random graphs, pp.76–96

  ---

• Alvaro Carbonero, Beth Anne Castellano, Gary Gordon, Charles Kulick, Brittany Ohlinger and Karie Schmitz
  • Permutations of point sets in $\mathbb{R}^d$, pp.97–135

  ---

• Maria Loukaki
  • Doubly stochastic arrays with small support, pp.136–148

  ---

• Julien Bensmail
  • Some properties of minimal arbitrarily partitionable graphs, pp.149–168

  ---

• Richard A. Brualdi and Lei Cao
  • $123$-Forcing matrices, pp.169–186

  ---

• Juan B. Gil and Jessica A. Tomasko
  • Pattern-avoiding even and odd Grassmannian permutations, pp.187–205

  ---

• Anthony B. Evans
  • On the number of orthomorphisms of the cyclic group of order nine, pp.206–221

  ---

• Joshua Basman Monterrubio, Graeme Henrickson and Anna Stokke
  • Cyclic sieving for a family of semistandard tableaux, pp.222–232

  ---

• Part 2

  ---

• Elena Fimmel, Christian J. Michel, François Pirot, Jean-Sébastien Sereni and Lutz Strüngmann
  • Diletter and triletter comma-free codes over finite alphabets, pp.233–270

  ---

• Melanie Fraser and Karen Yeats
  • Column expansion identities and quadratic spanning forest identities, pp.271–307

  ---

• Lev Glebsky, Melany Licón and Luis Manuel Rivera
  • On the number of even roots of permutations, pp.308–319

  ---

• Katja Mönius and Wasin So
  • How many non-isospectral integral circulant graphs are there?, pp.320–335

  ---

• Ryan C. Bunge, Saad I. El-Zanati, Peter Florido, Cole Gaskins, William F. Turner and Patrick Ward
  • On loose 3-cycle decompositions of complete 4-uniform hypergraphs, pp.336–350

  ---

• Soukaina Zayat and Salman Ghazal
  • Tournaments and the Erdős-Hajnal conjecture , pp.351–372

  ---

• Part 3

  ---

• Chris Godsil, Krystal Guo and Mariia Sobchuk
  • Diagonal entries of the average mixing matrix, pp.373–386

  ---

• Per Alexandersson and Frether Getachew Kebede
  • An involution on derangements preserving excedances and right-to-left minima, pp.387–413

  ---

• Dudley Stark
  • The small cycle counts of random feedback shift registers, pp.414–422

  ---

• Mohamed Omar
  • Sets avoiding full-rank three-point patterns in $(\mathbb{F}_q^n)^k$ are exponentially small, pp.423–429

  ---

• Mario Huicochea and Amanda Montejano
  • Erdős-Ginzburg-Ziv type generalizations for linear equations and linear inequalities in three variables, pp.430–441

  ---

• Joshua Carlson and Jürgen Kritschgau
  • Generalizing forbidden induced subgraph characterizations of high throttling numbers, pp.442–457

  ---

• Daniel W. Cranston and Hudson LaFayette
  • The $t$-tone chromatic number of classes of sparse graphs, pp.458–476

  ---

• Klaus Metsch
  • On the treewidth of generalized Kneser graphs, pp.477–486

  ---