5 citations · 7 across the 13 of their papers we have counts for
16 papers
Decomposing tournaments into comparability graphs
Pierre Aboulker, Logan Crew, Julien Duron +7
In this note, we introduce the \emph{partial order decomposition number} of a digraph , denoted , defined as the minimum integer such that $A(D)=A(P_1)\cup\cdots\cup…
Characterizing Large Clique Number in Tournaments
Logan Crew, Xinyue Fan, Hidde Koerts +2
Aboulker, Aubian, Charbit, and Lopes (2023) defined the clique number of a tournament to be the minimum clique number of one of its backedge graphs. Here we show that if is a t…
On prime Cayley graphs
Maria Chudnovsky, Michal Cizek, Logan Crew +4
The decomposition of complex networks into smaller, interconnected components is a central challenge in network theory with a wide range of potential applications. In this paper, w…
The Kromatic Symmetric Function: A -theoretic Analogue of
Logan Crew, Oliver Pechenik, Sophie Spirkl
Schur functions are a basis of the symmetric function ring that represent Schubert cohomology classes for Grassmannians. Replacing the cohomology ring with -theory yields a rich…
e-basis Coefficients of Chromatic Symmetric Functions
Logan Crew, Yongxing Zhang
A well-known result of Stanley's shows that given a graph with chromatic symmetric function expanded into the basis of elementary symmetric functions as , th…
Homogeneous Sets in Graphs and a Chromatic Multisymmetric Function
Logan Crew, Evan Haithcock, Josephine Reynes +1
In this paper, we extend the chromatic symmetric function to a chromatic -multisymmetric function , defined for graphs equipped with a partition of their vertex set int…