Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty
- Submitting institution
-
The University of Sheffield
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 2511
- Type
- E - Conference contribution
- DOI
-
10.1137/1.9781611975482.45
- Title of conference / published proceedings
- Proceedings of the 2019 Annual ACM-SIAM Symposium on Discrete Algorithms
- First page
- 714
- Volume
- -
- Issue
- -
- ISSN
- -
- Open access status
- -
- Month of publication
- January
- Year of publication
- 2019
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
A - Algorithms
- Citation count
- -
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- One important question in graph property testing is to give a purely combinatorial characterization of which graph properties are testable with a constant number of queries. This paper gives a novel necessary condition for testable properties in bounded degree graphs. The paper was described as "very interesting" in a recent survey (doi.org/10.1007/s12626-019-00054-0) by Prof. Ito at the University of Electro-Communications in Tokyo. The results led to a new collaboration on a joint paper with researchers at Leeds University, that was recently accepted to top conference SODA 2021 (https://www.siam.org/conferences/cm/program/accepted-papers/soda21-accepted-papers).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -