11 citations · 38 across the 16 of their papers we have counts for
4 papers · 1 filter
A note on intersecting hypergraphs with large cover number
Penny Haxell, Alex Scott
We give a construction of r-partite r-uniform intersecting hypergraphs with cover number at least r-4 for all but finitely many r. This answers a question of Abu-Khazneh, Barat, Po…
A Note on Schnyder's Theorem
Fidel Barrera-Cruz, Penny Haxell
We give an alternate proof of Schnyder's Theorem, that the incidence poset of a graph has dimension at most three if and only if is planar.
How to morph planar graph drawings
Soroush Alamdari, Patrizio Angelini, Fidel Barrera-Cruz +10
Given an -vertex graph and two straight-line planar drawings of the graph that have the same faces and the same outer face, we show that there is a morph (i.e., a continuous tra…
Homological connectivity of random hypergraphs
Oliver Cooley, Penny Haxell, Mihyun Kang +1
We consider simplicial complexes that are generated from the binomial random 3-uniform hypergraph by taking the downward-closure. We determine when this simplicial complex is homol…