44 citations · 71 across the 21 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
math.CO2016
Tight bounds and conjectures for the isolation lemma
Vance Faber, David G. Harris
Given a hypergraph and a weight function on its vertices, we say that is isolating if there is exactly one edge of minimum weight $w(e) =…
math.CO2016★ 1 cited
Linear Hypergraph Edge Coloring
Vance Faber
Motivated by the Erdos-Faber Lovasz conjecture (EFL) for hypergraphs, we explore relationships between several conjectures on the edge coloring of linear hypergraphs. In particular…
math.CO2016★ 1 cited
Hypergraph Versals
Vance Faber, Noah Streib
Let H be a hypergraph on n vertices with the property that no edge contains another. We prove some results for a special case of the Isolation Lemma when the label set for the edge…