3 papers
math.CO2026
Enumeration of dihypergraphs with specified degrees and edge types
Catherine Greenhill, Tamás Makai
A directed hypergraph (dihypergraph) consists of a set of vertices and a set of hyperarcs, where each hyperarc is partitioned into a head and a tail. Directed hypergraphs are usefu…
math.CO2026
Asymptotic enumeration of constrained bipartite, directed and oriented graphs by degree sequence
Catherine Greenhill, Mahdieh Hasheminezhad, Isaiah Iliffe +1
In the sufficiently sparse case, we find the probability that a uniformly random bipartite graph with given degree sequence contains no edge from a specified set of edges. This ena…
cs.DM2025
The random -SAT Gibbs uniqueness threshold revisited
Arnab Chatterjee, Amin Coja-Oghlan, Catherine Greenhill +4
We prove that for any for clause/variable ratios up to the Gibbs uniqueness threshold of the corresponding Galton-Watson tree, the number of satisfying assignments of rand…