Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference20 articles.
1. Bárány, I.: A generalization of Carathéodory’s theorem. Discrete Math. 40(2), 141–152 (1982)
2. Bernstein, A.J.: Maximally connected arrays on the $$n$$ n -cube. SIAM J. Appl. Math. 15(6), 1485–1489 (1967)
3. Boros, E., Füredi, Z.: The number of triangles covering the center of an $$n$$ n -set. Geom. Dedicata 17(1), 69–77 (1984)
4. Burtin, Y.D.: On the probability of connectedness of a random subgraph of the $$n$$ n -cube. Probl. Peredachi Inf. 13, 90–95 (1977)
5. Dotterrer, D., Kahle, M.: Coboundary expanders. J. Topol. Anal. 4(04), 499–514 (2012)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献