12 citations · 147 across the 77 of their papers we have counts for
9 papers · 1 filter
A note on simplicial cliques
Maria Chudnovsky, Alex Scott, Paul Seymour +1
Motivated by an application in condensed matter physics and quantum information theory, we prove that every non-null even-hole-free claw-free graph has a simplicial clique, that is…
A complete multipartite basis for the chromatic symmetric function
Logan Crew, Sophie Spirkl
In the vector space of symmetric functions, the elements of the basis of elementary symmetric functions are (up to a factor) the chromatic symmetric functions of disjoint unions of…
Pure pairs. VI. Excluding an ordered tree
Alex Scott, Paul Seymour, Sophie Spirkl
A pure pair in a graph is a pair of disjoint sets of vertices such that either every vertex in is adjacent to every vertex in , or there are no edges bet…
Pure pairs. IV. Trees in bipartite graphs
Alex Scott, Paul Seymour, Sophie Spirkl
In this paper we investigate the bipartite analogue of the strong Erdos-Hajnal property. We prove that for every forest and every there exists , such that if has…
A Vertex-Weighted Tutte Symmetric Function, and Constructing Graphs with Equal Chromatic Symmetric Function
José Aliste-Prieto, Logan Crew, Sophie Spirkl +1
This paper has two main parts. First, we consider the Tutte symmetric function , a generalization of the chromatic symmetric function. We introduce a vertex-weighted version of…
List-three-coloring -free graphs with no induced 1-subdivision of
Maria Chudnovsky, Sophie Spirkl, Mingxian Zhong
Let and be positive integers. We use to denote the path with vertices and to denote the complete bipartite graph with parts of size and respecti…