2 citations · 2 across the 1 of their papers we have counts for
5 papers
Finding Independent Transversals Efficiently
Alessandra Graf, Penny Haxell
We give an efficient algorithm that, given a graph and a partition of its vertex set, finds either an independent transversal (an independent set $\{v_1,\ldots…
Goldberg's Conjecture is true for random multigraphs
Penny Haxell, Michael Krivelevich, Gal Kronenberg
In the 70s, Goldberg, and independently Seymour, conjectured that for any multigraph , the chromatic index satisfies , where…
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…