Bethany Austhof

activity

20182025

collaborators

3 papers

cs.IT2025

Non-adaptive Learning of Random Hypergraphs with Queries

Bethany Austhof, Lev Reyzin, Erasmo Tani

We study the problem of learning a hidden hypergraph $G = (V, E)$ by making a single batch of queries (non-adaptively). We consider the hyperedge detection model, in which every query…

math.CO2021

The set of ratios of derangements to permutations in digraphs is dense in $[0, 1/2]$

Bethany Austhof, Patrick Bennett, Nick Christo

A permutation in a digraph $G = (V, E)$ is a bijection $f : V \to V$ such that for all $v \in V$ we either have that $f$ fixes $v$ or $(v, f (v)) \in E$ . A derangement in $G$ is…

math.CO2018

Nearly-Regular Hypergraphs and Saturation of Berge Stars

Bethany Austhof, Sean English

Given a graph $G$ , we say a $k$ -uniform hypergraph $H$ on the same vertex set contains a Berge- $G$ if there exists an injection $ϕ : E (G) \to E (H)$ such that $e \subseteq ϕ (e)$ for each…

Non-adaptive Learning of Random Hypergraphs with Queries

The set of ratios of derangements to permutations in digraphs is dense in [0,1/2]

Nearly-Regular Hypergraphs and Saturation of Berge Stars

The set of ratios of derangements to permutations in digraphs is dense in $[0, 1/2]$