Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference11 articles.
1. Alon, N., Spencer, J.H.: The probabilistic method, Wiley, 1991
2. Bollobás, B., Eldbridge, S.E.: Packing of graphs and applications to computational complexity, J. Comb. Theory, Ser.B 25, 105?124 (1978)
3. Bollobás, B.: Extremal graph theory, Academic Press, London, 1978, Chapter 8
4. Catlin, P.A.: Subgraphs of graphs, Discrete Math.10, 225?233 (1974)
5. Doyen, J.: Constructions of disjoint Steiner Triple Systems, Proc. Amer. Math. Soc.32, 409?416 (1972)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Packing random graphs and hypergraphs;Random Structures & Algorithms;2016-11
2. Hypergraph Packing and Graph Embedding;Combinatorics, Probability and Computing;1999-07
3. Random methods in design theory: A survey;Journal of Combinatorial Designs;1996