12 citations · 80 across the 51 of their papers we have counts for
5 papers · 2 filters
A Deletion-Contraction Relation for the Chromatic Symmetric Function
Logan Crew, Sophie Spirkl
We extend the definition of the chromatic symmetric function to include graphs with a vertex-weight function . We show how this provides…
Disproportionate division
Logan Crew, Bhargav Narayanan, Sophie Spirkl
We study the disproportionate version of the classical cake-cutting problem: how efficiently can we divide a cake, here , among agents with different demands $α_1, α_2,…
On symmetric intersecting families of vectors
Sean Eberhard, Jeff Kahn, Bhargav Narayanan +1
A family of vectors is said to be intersecting if any two elements of agree on at least one coordinate. We prove, for fixed , that the size of a symm…
Detecting an odd hole
Maria Chudnovsky, Alex Scott, Paul Seymour +1
A hole in a graph G is an induced cycle of length at least four; an antihole is a hole in the complement of G. In 2005, Chudnovsky, Cornuejols, Liu, Seymour and Vuskovic showed tha…
Concatenating bipartite graphs
Maria Chudnovsky, Patrick Hompe, Alex Scott +2
Let and let be disjoint nonempty subsets of a graph , where every vertex in has at least neighbours in , and every vertex in has at least…