2 papers
quant-ph2026
Almost all graphs are vertex-minor universal
Ruben Ascoli, Bryce Frederickson, Sarah Frederickson +2
Answering a question of Claudet, we prove that the uniformly random graph is -vertex-minor universal with high probability. That is, for some…
math.CO2025
Asymptotically half of binary words are shuffle squares
Xiaoyu He, Logan Post
A binary shuffle square is a binary word of even length that can be partitioned into two disjoint, identical subwords. Huang, Nam, Thaper, and the first author conjectured that as…