A counter-example to the probabilistic universal graph conjecture via randomized communication complexity-Reference-Cited by-同舟云学术

A counter-example to the probabilistic universal graph conjecture via randomized communication complexity

Author:

Hambardzumyan Lianna,Hatami Hamed,Hatami Pooya^ORCID

Funder

National Science Foundation

NSF

Natural Sciences and Engineering Research Council of Canada

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference14 articles.

1. On lower layers of a lattice of hereditary classes of graphs;Alekseev;Diskretn. Anal. Issled. Oper. Ser. 1,1997

4. Dimension-free bounds and structural results in communication complexity;Hambardzumyan;Israel J. Math.,2021

5. Universal communication, universal graphs, and graph labeling;Harms,2020

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

2. Hardness Condensation by Restriction;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

3. No Complete Problem for Constant-Cost Randomized Communication;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

5. Randomized communication and implicit graph representations;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09