Every testable (infinite) property of bounded-degree graphs contains an infinite hyperfinite subproperty

Fichtenberger, H., Peng, P. orcid.org/0000-0003-2700-5699 and Sohler, C. (Accepted: 2018) Every testable (infinite) property of bounded-degree graphs contains an infinite hyperfinite subproperty. In: Proceedings of 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA19). 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA19), 06-09 Jan 2019, San Diego, California. SIAM . (In Press)

Metadata

Authors/Creators:
Copyright, Publisher and Additional Information: © 2018 SIAM.
Dates:
  • Accepted: 27 September 2018
Institution: The University of Sheffield
Academic Units: The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield)
Depositing User: Symplectic Sheffield
Date Deposited: 06 Dec 2018 11:01
Last Modified: 06 Dec 2018 11:01
Status: In Press
Publisher: SIAM
Refereed: Yes

Download

Accepted Version


Under temporary embargo

Filename: arxiv.pdf

Request a copy

Share / Export