2000 character limit reached
Optimal Adjacency Labels for Subgraphs of Cartesian Products (2206.02872v3)
Published 6 Jun 2022 in cs.DS and math.CO
Abstract: For any hereditary graph class $F$, we construct optimal adjacency labeling schemes for the classes of subgraphs and induced subgraphs of Cartesian products of graphs in $F$. As a consequence, we show that, if $F$ admits efficient adjacency labels (or, equivalently, small induced-universal graphs) meeting the information-theoretic minimum, then the classes of subgraphs and induced subgraphs of Cartesian products of graphs in $F$ do too. Our proof uses ideas from randomized communication complexity, hashing, and additive combinatorics, and improves upon recent results of Chepoi, Labourel, and Ratel [Journal of Graph Theory, 2020].
- Graph parameters, implicit representations and factorial properties. Discrete Mathematics, 346(10):113573, 2023.
- Graph functionality. Journal of Combinatorial Theory, Series B, 147:139–158, 2021.
- Derandomization, witnesses for boolean matrix multiplication and construction of perfect hash functions. Algorithmica, 16(4/5):434–449, 1996.
- Sidon sets in groups and induced subgraphs of Cayley graphs. European Journal of Combinatorics, 6(2):101–114, 1985.
- Chin-Long Chen. Formulas for the solutions of quadratic equations over GF(2m)GFsuperscript2𝑚\textrm{GF}(2^{m})GF ( 2 start_POSTSUPERSCRIPT italic_m end_POSTSUPERSCRIPT ) (corresp.). IEEE Transactions on Information Theory, 28(5):792–794, 1982.
- On density of subgraphs of Cartesian products. Journal of Graph Theory, 93(1):64–87, 2020.
- Sketching distances in monotone graph classes. In Amit Chakrabarti and Chaitanya Swamy, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference), volume 245 of LIPIcs, pages 18:1–18:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
- Optimal adjacency labels for subgraphs of cartesian products. In Kousha Etessami, Uriel Feige, and Gabriele Puppis, editors, 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, July 10-14, 2023, Paderborn, Germany, volume 261 of LIPIcs, pages 57:1–57:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.
- Ron L. Graham. On primitive graphs and optimal vertex assignments. Annals of the New York academy of sciences, 175(1):170–186, 1970.
- Nathaniel Harms. Universal communication, universal graphs, and graph labeling. In 11th Innovations in Theoretical Computer Science Conference (ITCS 2020), volume 151, page 33. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2020.
- Nathaniel Harms. Adjacency labeling and sketching for induced subgraphs of the hypercube. https://cs.uwaterloo.ca/~nharms/downloads/hypercube_sketch.pdf, 2022.
- David Haussler. Sphere packing numbers for subsets of the Boolean n𝑛nitalic_n-cube with bounded Vapnik-Chervonenkis dimension. Journal of Combinatorial Theory, Series A, 69(2):217–232, 1995.
- The implicit graph conjecture is false. In 63rd IEEE Symposium on Foundations of Computer Science (FOCS 2022), pages 1134–1137, 2022.
- A counter-example to the probabilistic universal graph conjecture via randomized communication complexity. Discrete Applied Math., 322:117–122, 2022.
- Efficient minimal perfect hashing in nearly minimal space. In Annual Symposium on Theoretical Aspects of Computer Science (STACS 2001), pages 317–326. Springer, 2001.
- Randomized communication and implicit graph representations. In 54th Annual Symposium on Theory of Computing (STOC 2022), 2022.
- Implicit representation of graphs. SIAM Journal on Discrete Mathematics, 5(4):596–603, 1992.
- Bernt Lindström. Determination of two vectors from the sum. Journal of Combinatorial Theory, 6(4):402–407, 1969.
- Kurt Mehlhorn. Data Structures and Algorithms 1 Sorting and Searching. Monographs in Theoretical Computer Science. An EATCS Series, 1. Springer Berlin Heidelberg, Berlin, Heidelberg, 1st ed. 1984. edition, 1984.
- John H. Muller. Local structure in graph classes. 1989.
- Handbook of applied cryptography. CRC press, 2001.
- Edward R. Scheinerman. Local representations using very short labels. Discrete mathematics, 203(1-3):287–290, 1999.
- Victor Shoup. New algorithms for finding irreducible polynomials over finite fields. Mathematics of computation, 54(189):435–447, 1990.
- Jeremy P. Spinrad. Efficient graph representations. American Mathematical Society, 2003.
- Andrew Chi-Chih Yao. On the power of quantum fingerprinting. In Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing (STOC), pages 77–81, 2003.