Lenstra

Fixed-Parameter Tractability of $t$-Uniform Hypergraphicality

arXiv:2606.08523v1 Announce Type: cross Abstract: We study the $t$-uniform hypergraphicality problem under a compressed representation of the degree sequence. Instead of listing all vertex degrees explicitly, the input consists of pairs $$ (\delta_1,n_1),\dots,(\delta_k,n_k), $$ meaning that exactly $n_i$ vertices have degree $\delta_i$. Thus the parameter $k$ denotes the number of distinct degrees.