Document

# Testing Triangle Freeness in the General Model in Graphs with Arboricity O(√n)

## File

LIPIcs.ICALP.2021.93.pdf
• Filesize: 0.75 MB
• 13 pages

## Cite As

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). Leibniz International Proceedings in Informatics (LIPIcs), Volume 198, pp. 93:1-93:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
https://doi.org/10.4230/LIPIcs.ICALP.2021.93

## Abstract

We study the problem of testing triangle freeness in the general graph model. This problem was first studied in the general graph model by Alon et al. (SIAM J. Discret. Math. 2008) who provided both lower bounds and upper bounds that depend on the number of vertices and the average degree of the graph. Their bounds are tight only when d_max = O(d) and ̄{d} ≤ √n or when ̄{d} = Θ(1), where d_max denotes the maximum degree and ̄{d} denotes the average degree of the graph. In this paper we provide bounds that depend on the arboricity of the graph and the average degree. As in Alon et al., the parameters of our tester is the number of vertices, n, the number of edges, m, and the proximity parameter ε (the arboricity of the graph is not a parameter of the algorithm). The query complexity of our tester is Õ(Γ/ ̄{d} + Γ)⋅ poly(1/ε) on expectation, where Γ denotes the arboricity of the input graph (we use Õ(⋅) to suppress O(log log n) factors). We show that for graphs with arboricity O(√n) this upper bound is tight in the following sense. For any Γ ∈ [s] where s = Θ(√n) there exists a family of graphs with arboricity Γ and average degree ̄{d} such that Ω(Γ/ ̄{d} + Γ) queries are required for testing triangle freeness on this family of graphs. Moreover, this lower bound holds for any such Γ and for a large range of feasible average degrees .

## Subject Classification

##### ACM Subject Classification
• Theory of computation → Streaming, sublinear and near linear time algorithms
##### Keywords
• Property Testing
• Triangle-Freeness

## Metrics

• Access Statistics
• Total Accesses (updated on a weekly basis)
0

## References

1. Noga Alon. Testing subgraphs in large graphs. Random Struct. Algorithms, 21(3-4):359-370, 2002. URL: https://doi.org/10.1002/rsa.10056.
2. Noga Alon, Eldar Fischer, Michael Krivelevich, and Mario Szegedy. Efficient testing of large graphs. Combinatorica, 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 J. Discret. Math., 22(2):786-819, 2008. URL: https://doi.org/10.1137/07067917X.
4. Talya Eden, Reut Levi, and Dana Ron. Testing bounded arboricity. ACM Trans. Algorithms, 16(2):18:1-18:22, 2020. URL: https://doi.org/10.1145/3381418.
5. Talya Eden, Dana Ron, and Will Rosenbaum. The arboricity captures the complexity of sampling edges. In Christel Baier, Ioannis Chatzigiannakis, Paola Flocchini, and Stefano Leonardi, editors, 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, July 9-12, 2019, Patras, Greece, volume 132 of LIPIcs, pages 52:1-52:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. URL: https://doi.org/10.4230/LIPIcs.ICALP.2019.52.
6. Talya Eden, Dana Ron, and C. Seshadhri. Sublinear time estimation of degree distribution moments: The arboricity connection. SIAM J. Discret. Math., 33(4):2267-2285, 2019. URL: https://doi.org/10.1137/17M1159014.
7. Talya Eden, Dana Ron, and C. Seshadhri. Faster sublinear approximation of the number of k-cliques in low-arboricity graphs. In Shuchi Chawla, editor, Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020, pages 1467-1478. SIAM, 2020. URL: https://doi.org/10.1137/1.9781611975994.89.
8. Oded Goldreich, Shafi Goldwasser, and Dana Ron. Property testing and its connection to learning and approximation. Journal of the ACM (JACM), 45(4):653-750, 1998.
9. Oded Goldreich and Dana Ron. Property testing in bounded degree graphs. Algorithmica, 32(2):302-343, 2002. URL: https://doi.org/10.1007/s00453-001-0078-7.
10. L. Gugelmann. Testing triangle-freeness in general graphs: Lower bounds. Bachelor thesis, Dept. of Mathematics, ETH, Zurich, 2006.
11. Tali Kaufman, Michael Krivelevich, and Dana Ron. Tight bounds for testing bipartiteness in general graphs. SIAM Journal on Computing, 33(6):1441-1483, 2004. URL: https://doi.org/10.1137/S0097539703436424.
12. Michal Parnas and Dana Ron. Testing the diameter of graphs. Random Struct. Algorithms, 20(2):165-183, 2002. URL: https://doi.org/10.1002/rsa.10013.
13. T. Rast. Testing triangle-freeness in general graphs: Upper bounds. Bachelor thesis, Dept. of Mathematics, ETH, Zurich, 2006.
X

Feedback for Dagstuhl Publishing