Isaiah Hollars

activity

20222026

most citedA natural bijection for contiguous pattern avoidance in words

1 citations · 1 across the 3 of their papers we have counts for

collaborators

4 papers

math.CO2026

Hitting all maximal independent sets in $c$ -hollow graphs

Joshua Cooper, Isaiah Hollars

Fix a constant $c$ with $0 < c < 1$ . We say a graph $G$ on $n$ vertices is $c$ -hollow if every maximal independent set of $G$ has size at least $c n$ . Denote by $τ (G)$ the size of a sma…

math.CO2026

Small $q$ -kernels in digraphs with minimum in-degree $δ$

Geoffrey Boyer, Matt Burnham, Daniela Černá +5

For a digraph $D$ , a subset $Q \subseteq V (D)$ is called a $q$ -kernel if $Q$ is an independent set and all vertices in $V (D)$ are reachable from $Q$ via a directed path of length at…

math.CO2025

Pancyclicity in hypergraphs with large uniformity

Teegan Bailey, Isaiah Hollars, Yupei Li +1

A Berge cycle of length $ℓ$ in a hypergraph $H$ is a sequence of alternating vertices and edges $v_{0} e_{0} v_{1} e_{1} ... v_{ℓ} e_{ℓ} v_{0}$ such that $\{v_i,v_{i+1}\}\subseteq…

math.CO2022★ 1 cited

A natural bijection for contiguous pattern avoidance in words

Julia Carrigan, Isaiah Hollars, Eric Rowland

Two words $p$ and $q$ are avoided by the same number of length- $n$ words, for all $n$ , precisely when $p$ and $q$ have the same set of border lengths. Previous proofs of this theor…

Hitting all maximal independent sets in c-hollow graphs

Small q-kernels in digraphs with minimum in-degree δ

Pancyclicity in hypergraphs with large uniformity

A natural bijection for contiguous pattern avoidance in words

Hitting all maximal independent sets in $c$ -hollow graphs

Small $q$ -kernels in digraphs with minimum in-degree $δ$