Ball hypergraphs on graphs of treewidth t have proper sample compression schemes of size O(t log t), tight up to log factors and improving prior quadratic bounds.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DM 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Sample compression schemes for balls in structurally sparse graphs
Ball hypergraphs on graphs of treewidth t have proper sample compression schemes of size O(t log t), tight up to log factors and improving prior quadratic bounds.