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. (2019) Every testable (infinite) property of bounded-degree graphs contains an infinite hyperfinite subproperty. In: Chan, T., (ed.) Proceedings of the 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 . ISBN 978-1-61197-548-2

Abstract

Metadata

Authors/Creators:
Copyright, Publisher and Additional Information: © 2019 The Authors. Reproduced in accordance with the publisher's self-archiving policy.
Dates:
  • Accepted: 27 September 2018
  • Published (online): 6 January 2019
  • Published: 6 January 2019
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: 18 Jun 2019 15:33
Status: Published
Publisher: SIAM
Refereed: Yes
Identification Number: https://doi.org/10.1137/1.9781611975482.45

Share / Export

Statistics