Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference11 articles.
1. J. B. Kruskal: The number of simplices in a complex, in:Mathematical optimization Techniques, Berkeley and Los Angeles, 1963, 251?278.
2. G. Katona: A theorem on finite sets, in:Theory of Graphs Proc. Colloq. Tihany 1966, Akad�miai Kiad�, 1968, 187?207.
3. L. H. Harper: Optimal numberings and isoperimetric problems on graphs.J. Combin. Theory,1 (1966), 385?393.
4. J. Eckhoff andG. Wegner: �ber einen Satz von Kruskal,Periodica Math. Hungar., Vol6 (2) (1975), 137?142.
5. R. Ahlswede, P. G�cs, andJ. K�rner: Bounds on conditional probabilities with applications in multiuser communication,Z. Wahrsch. und Verw. Gebiete, Vol.34 (1976), 157?177.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Restricted Word Shadow Problem;Information Theory, Combinatorics, and Search Theory;2013
2. Shadows under the word-subword relation;Problems of Information Transmission;2012-03
3. Lectures on Advances in Combinatorics;UNIVERSITEXT;2008
4. Nonexistence of a Kruskal-Katona Type Theorem for Subword Orders;Combinatorica;2004-04-01
5. On Shifts of Cascades;Numbers, Information and Complexity;2000