L. Stacho

activity

20082024

most citedA Tight Bound on the Maximum Interference of Random Sensors in the Highway Model

8 citations · 32 across the 22 of their papers we have counts for

collaborators

Showing 2024Show all

2 papers · 1 filter

math.CO2024

Bipartite graphs are $(\frac{4}{5} - ε) \frac{Δ}{l o g Δ}$ -choosable

Peter Bradshaw, Bojan Mohar, Ladislav Stacho

Alon and Krivelevich conjectured that if $G$ is a bipartite graph of maximum degree $Δ$ , then the choosability (or list chromatic number) of $G$ satisfies $χ_{\ell}(G) = O \left (…

cs.FL2024

A cornering strategy for synchronizing a DFA

Peter Bradshaw, Alexander Clow, Ladislav Stacho

This paper considers the existence of short synchronizing words in deterministic finite automata (DFAs). We define two general strategies for generating synchronizing words, and we…

Bipartite graphs are (54​−ε)logΔΔ​-choosable

A cornering strategy for synchronizing a DFA

Bipartite graphs are $(\frac{4}{5} - ε) \frac{Δ}{l o g Δ}$ -choosable