Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty
From MaRDI portal
Publication:5236227
DOI10.1137/1.9781611975482.45zbMath1431.68136arXiv1811.02937OpenAlexW2899780222MaRDI QIDQ5236227
Hendrik Fichtenberger, Pan Peng, Christian Sohler
Publication date: 15 October 2019
Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.02937
Related Items
Approximation algorithm for (connected) bounded-degree deletion problem on unit disk graphs ⋮ Faster Property Testers in a Variation of the Bounded Degree Model ⋮ Maximum weight t-sparse set problem on vector-weighted graphs ⋮ Unnamed Item ⋮ An explicit construction of graphs of bounded degree that are far from being Hamiltonian