2 citations · 2 across the 2 of their papers we have counts for
3 papers
math.CO2026
Exponentially Many Circuit Double Covers
Radek Hušek, Robert Šámal
The cycle double cover conjecture of Szekeres and Seymour, the proof of which was recently announced by OpenAI, states that every bridgeless graph has a collection of cycles coveri…
math.CO2019
Homomorphisms of Cayley graphs and Cycle Double Covers
Radek Hušek, Robert Šámal
We study the following conjecture of Matt DeVos: If there is a graph homomorphism from Cayley graph Cay(M, B) to another Cayley graph Cay(M', B') then every graph with an (M, B)-fl…
cs.DM2017★ 2 cited
Group Connectivity: v.
Radek Hušek, Lucie Mohelníková, Robert Šámal
We answer a question on group connectivity suggested by Jaeger et al. [Group connectivity of graphs -- A nonhomogeneous analogue of nowhere-zero flow properties, JCTB 1992]: we fin…