9 citations · 9 across the 3 of their papers we have counts for
5 papers
Seymour's Second Neighborhood Conjecture for Subsets of Vertices
Tyler Seacrest
Seymour conjectured that every oriented simple graph contains a vertex whose second neighborhood is at least as large as its first. In this note, we put forward a conjecture that w…
Multi-Switch: a Tool for Finding Potential Edge-Disjoint -factors
Tyler Seacrest
Let be even, let be a graphic degree sequence, and let also be graphic. Kundu proved that has a realization …
The Arc-Weighted Version of the Second Neighborhood Conjecture
Tyler Seacrest
Seymour conjectured that every oriented simple graph contains a vertex whose second neighborhood is at least as large as its first. Seymour's conjecture has been verified in severa…
On Blow-Ups and Injectivity of Quivers
Will Grilliette, Deborah E. Seacrest, Tyler Seacrest
This work connects the idea of a "blow-up" of a quiver with that of injectivity, showing that for a class of monic maps , a quiver is -injective if and only if all blow-ups o…
A lower bound technique for triangulations of simplotopes
Tyler Seacrest, Francis Edward Su
Products of simplices, called simplotopes, and their triangulations arise naturally in algorithmic applications in game theory and optimization. We develop techniques to derive low…