Kevin G. Milans

collaborators

2 papers

math.CO2026

Tight paths in fully directed hypergraphs

Richard C. Devine, Kevin G. Milans

It is well-known that every tournament has a spanning path. We consider hypergraph analogues. In an \emph{ $r$ -uniform fully directed hypergraph}, or \emph{ $r$ -digraph}, every edge…

math.CO2024

Longest Path and Cycle Transversals in Chordal Graphs

James A. Long, Kevin G. Milans, Michael C. Wigal

We show that if $G$ is a $n$ -vertex connected chordal graph, then it admits a longest path transversal of size $O (lo g^{2} n)$ . Under the stronger assumption of 2-connectivity, we sh…