Document Open Access Logo

Results on H-Freeness Testing in Graphs of Bounded r-Admissibility

Authors Christine Awofeso , Patrick Greaves , Oded Lachish , Felix Reidl

PDF
Thumbnail PDF

File

LIPIcs.STACS.2025.12.pdf
  • Filesize: 0.83 MB
  • 16 pages

Document Identifiers

Author Details

Christine Awofeso
  • Birkbeck, University of London, UK
Patrick Greaves
  • Birkbeck, University of London, UK
Oded Lachish
  • Birkbeck, University of London, UK
Felix Reidl
  • Birkbeck, University of London, UK

Cite As Get BibTex

Christine Awofeso, Patrick Greaves, Oded Lachish, and Felix Reidl. Results on H-Freeness Testing in Graphs of Bounded r-Admissibility. In 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 327, pp. 12:1-12:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.STACS.2025.12

Abstract

We study the property of H-freeness in graphs with known bounded average degree, i.e. the property of a graph not containing some graph H as a subgraph. H-freeness is one of the fundamental graph properties that has been studied in the property testing framework.
Levi [Reut Levi, 2021] showed that triangle-freeness is testable in graphs of bounded arboricity, which is a superset of e.g. planar graphs or graphs of bounded degree. Complementing this result is a recent preprint [Talya Eden et al., 2024] by Eden ηl which shows that, for every r ≥ 4, C_r-freeness is not testable in graphs of bounded arboricity.
We proceed in this line of research by using the r-admissibility measure that originates from the field of structural sparse graph theory. Graphs of bounded 1-admissibility are identical to graphs of bounded arboricity, while graphs of bounded degree, planar graphs, graphs of bounded genus, and even graphs excluding a fixed graph as a (topological) minor have bounded r-admissibility for any value of r [Nešetřil and Ossona de Mendez, 2012]. 
In this work we show that H-freeness is testable in graphs with bounded 2-admissibility for all graphs H of diameter 2. Furthermore, we show the testability of C₄-freeness in bounded 2-admissible graphs directly (with better query complexity) and extend this result to C₅-freeness. Using our techniques it is also possible to show that C₆-freeness and C₇-freeness are testable in graphs with bounded 3-admissibility. The formal proofs will appear in the journal version of this paper.
These positive results are supplemented with a lower bound showing that, for every r ≥ 4, C_r-freeness is not testable for graphs of bounded (⌊r/2⌋ - 1)-admissibility. This lower bound will appear in the journal version of this paper. This implies that, for every r > 0, there exists a graph H of diameter r+1, such that H-freeness is not testable on graphs with bounded r-admissibility. These results lead us to the conjecture that, for every r > 4, and t ≤ 2r+1, C_t-freeness is testable in graphs of bounded r-admissibility, and for every r > 2, H-freeness for graphs H of diameter r is testable in graphs with bounded r-admissibility.

Subject Classification

ACM Subject Classification
  • Theory of computation → Design and analysis of algorithms
Keywords
  • Property Testing
  • Sparse Graphs
  • Degeneracy
  • Admissibility

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. Noga Alon, Richard A. Duke, Hanno Lefmann, Vojtech Rödl, and Raphael Yuster. The algorithmic aspects of the regularity lemma. J. Algorithms, 16(1):80-109, 1994. URL: https://doi.org/10.1006/JAGM.1994.1005.
  2. Noga Alon, Eldar Fischer, Michael Krivelevich, and Mario Szegedy. Efficient testing of large graphs. Comb., 20(4):451-476, 2000. URL: https://doi.org/10.1007/S004930070001.
  3. Noga Alon, Tali Kaufman, Michael Krivelevich, and Dana Ron. Testing triangle-freeness in general graphs. SIAM Journal on Discrete Mathematics, 22(2):786-819, 2008. URL: https://doi.org/10.1137/07067917X.
  4. Artur Czumaj, Oded Goldreich, Dana Ron, C Seshadhri, Asaf Shapira, and Christian Sohler. Finding cycles and trees in sublinear time. Random Structures & Algorithms, 45(2):139-184, 2014. URL: https://doi.org/10.1002/RSA.20462.
  5. Artur Czumaj and Christian Sohler. A characterization of graph properties testable for general planar graphs with one-sided error (it’s all about forbidden subgraphs). In 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), pages 1525-1548. IEEE, 2019. URL: https://doi.org/10.1109/FOCS.2019.00089.
  6. Zdeněk Dvořák. Constant-factor approximation of the domination number in sparse graphs. European Journal of Combinatorics, 34(5):833-840, July 2013. URL: https://doi.org/10.1016/j.ejc.2012.12.004.
  7. Talya Eden, Reut Levi, and Dana Ron. Testing c_k-freeness in bounded-arboricity graphs. In Karl Bringmann, Martin Grohe, Gabriele Puppis, and Ola Svensson, editors, 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, July 8-12, 2024, Tallinn, Estonia, volume 297 of LIPIcs, pages 60:1-60:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. URL: https://doi.org/10.4230/LIPICS.ICALP.2024.60.
  8. Oded Goldreich and Dana Ron. Property testing in bounded degree graphs. In Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, pages 406-415, 1997. URL: https://doi.org/10.1145/258533.258627.
  9. H. A. Kierstead and W. T. Trotter. Planar graph coloring with an uncooperative partner. Journal of Graph Theory, 18(6):569-584, October 1994. URL: https://doi.org/10.1002/jgt.3190180605.
  10. Reut Levi. Testing triangle freeness in the general model in graphs with arboricity O(√n). In 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference), volume 198 of LIPIcs, pages 93:1-93:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. URL: https://doi.org/10.4230/LIPICS.ICALP.2021.93.
  11. David W Matula and Leland L Beck. Smallest-last ordering and clustering and graph coloring algorithms. Journal of the ACM (JACM), 30(3):417-427, 1983. URL: https://doi.org/10.1145/2402.322385.
  12. Jaroslav Nešetřil and Patrice Ossona de Mendez. Sparsity: Graphs, Structures, and Algorithms, volume 28 of Algorithms and Combinatorics. Springer, 2012. URL: https://doi.org/10.1007/978-3-642-27875-4.
  13. Andrew Chi-Chin Yao. Probabilistic computations: Toward a unified measure of complexity. In 18th Annual Symposium on Foundations of Computer Science (sfcs 1977), pages 222-227. IEEE Computer Society, 1977. Google Scholar
  14. Xuding Zhu. Colouring graphs with bounded generalized colouring number. Discrete Mathematics, 309(18):5562-5568, 2009. URL: https://doi.org/10.1016/J.DISC.2008.03.024.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact