Xujun Liu

most citedA combinatorial proof for the secretary problem with multiple choices

1 citations · 1 across the 3 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2022

Every subcubic multigraph is $(1, 2^{7})$ -packing edge-colorable

Xujun Liu, Michael Santana, Taylor Short

For a non-decreasing sequence $S = (s_{1}, \dots, s_{k})$ of positive integers, an $S$ -packing edge-coloring of a graph $G$ is a decomposition of edges of $G$ into disjoint sets $E_1,…

math.CO2022

Balanced and Swap-Robust Trades for Dynamical Distributed Storage

Chao Pan, Ryan Gabrys, Xujun Liu +2

Trades, introduced by Hedayat, are two sets of blocks of elements which may be exchanged (traded) without altering the counts of certain subcollections of elements within their con…

Every subcubic multigraph is (1,27)-packing edge-colorable

Balanced and Swap-Robust Trades for Dynamical Distributed Storage

Every subcubic multigraph is $(1, 2^{7})$ -packing edge-colorable