• Skip to main content

Anna Yu

Combinatorics and graph theory post-doc

  • Home
  • Research
  • Teaching
  • CV
  • LinkedIn Profile

Research

Research Interests

My primary research interests are Combinatorics, Design Theory, and Graph Edge Coloring. I have completed multiple projects generalizing theorems concerning factorizations of hypergraphs and completion of Latin squares with varied parameters, and have a project in-progress in the area of (multi)-graph edge coloring.

Click here to view my ORCID record.

Current Projects

  • Characterizing graphs achieving an upper bound on chromatic index involving girth
  • Generalizations of partial Latin square results

Publications

Published or Accepted

  1. Embedding Connected Factorizations (with Amin Bahmanian and Stefan Napirata), Journal of Combinatorial Theory, Series B, Volume 155, July 2022, pp. 358-373
  2. Existence of 2-factors in t-tough Graphs with Forbidden Induced Subgraphs (with Elizabeth Grimm and Songling Shan), Discrete Mathematics, Volume 346, Issue 10, October 2023
  3. Embedding connected factorizations II (with Amin Bahmanian), Journal of Combinatorial Theory, Series B, 2025

Submitted for Publication

  1. Ryser’s Theorem for Equitable Rectangles (with Amin Bahmanian), 19 pages, submitted spring 2024

In Preparation

  1. The Andersen-Hoffman Theorem for Equitable Rectangles (with Amin Bahmanian)
  2. Characterizing graphs achieving an upper bound on chromatic index involving girth (with Guantao Chen, Alireza Fiujlaali, and Jessica McDonald)

© 2025 Anna Johnsen. All rights reserved. · ajohnsen2@gsu.edu · Altitude Pro Genesis theme customized by Cloud Mountain Marketing.