2 citations · 2 across the 6 of their papers we have counts for
14 papers · 1 filter
Spanning subhypergraphs with degree constraints
Noga Alon, Penny Haxell, Aleksa Milojević +1
An old result of Tutte states that any -regular graph contains a spanning subgraph in which every vertex has degree or , for every . We generalize this s…
A Counterexample to a Conjecture of Lovász
Alexander Clow, Penny Haxell, Bojan Mohar
In 1975 Lovász conjectured that every -partite, -uniform hypergraph contains vertices whose deletion reduces the matching number. If true, this statement would imply a…
A bounded diameter strengthening of Kőnig's Theorem
Louis DeBiasio, António Girão, Penny Haxell +1
K\H onig's theorem says that the vertex cover number of every bipartite graph is at most its matching number (in fact they are equal since, trivially, the matching number is at mos…
Density of -critical signed graphs
Laurent Beaudou, Penny Haxell, Kathryn Nurse +2
We say that a signed graph is -critical if it is not -colorable but every one of its proper subgraphs is -colorable. Using the definition of colorability due to Naserasr,…
Constructing graphs with no independent transversals
Penny Haxell, Ronen Wdowinski
Given a graph and a partition of its vertex set, an independent transversal (IT) is an independent set of that contains one vertex from each block in . Various suffi…
A precise condition for independent transversals in bipartite covers
Stijn Cambie, Penny Haxell, Ross J. Kang +1
Given a bipartite graph in which any vertex in (resp.~) has degree at most (resp.~), suppose there is a partition of that is a refin…