Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference12 articles.
1. Neighborly families of boxes and bipartite coverings;Alon;Algorithms Combin.,1997
2. N. Bousquet, A. Lagoutte, S. Thomassé, Clique versus Independent Set, arXiv:1301.2474, 2013.
3. A comparison of two lower–bound methods for communication complexity;Dietzfelbinger;Theoret. Comput. Sci.,1996
4. M. Friesen, D.O. Theis, Fooling Sets (a.k.a. Cross-Free Matchings) and Rank in Non-Zero Characteristic, arXiv:1208.2920, 2012.
5. On embedding graphs in squashed cubes, in graph theory and applications;Graham;Lecture Notes in Math.,1972
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Unambiguous DNFs and Alon–Saks–Seymour;SIAM Journal on Computing;2023-10-20
2. Finding biclique partitions of co-chordal graphs;Discrete Applied Mathematics;2023-10
3. On the binary and Boolean rank of regular matrices;Journal of Computer and System Sciences;2023-06
4. Unambiguous DNFs and Alon-Saks-Seymour;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02
5. Communication Complexity and Graph Families;ACM Transactions on Computation Theory;2019-04-02