Extremal problems whose solutions are the blowups of the small witt-designs
暂无分享,去创建一个
[1] Zoltán Füredi,et al. A new generalization of the Erdős-Ko-Rado theorem , 1983, Comb..
[2] T. Motzkin,et al. Maxima for Graphs and a New Proof of a Theorem of Turán , 1965, Canadian Journal of Mathematics.
[3] N. J. A. Sloane,et al. Lower bounds for constant weight codes , 1980, IEEE Trans. Inf. Theory.
[4] Miklós Simonovits,et al. Supersaturated graphs and hypergraphs , 1983, Comb..
[5] P. Erdös. On extremal problems of graphs and generalized graphs , 1964 .
[6] B. Bollobás,et al. Extremal Graph Theory , 2013 .
[7] Vojtech Rödl,et al. Hypergraphs do not jump , 1984, Comb..
[8] Hanfried Lenz,et al. Design theory , 1985 .
[9] Gyula O. H. Katona,et al. Extremal Problems for Hypergraphs , 1975 .
[10] Zoltán Füredi,et al. Union-free Hypergraphs and Probability Theory , 1984, Eur. J. Comb..
[11] P. Turán. On the theory of graphs , 1954 .
[12] Vojtech Rödl,et al. Some Ramsey-Turán type results for hypergraphs , 1988, Comb..
[13] Zoltán Füredi,et al. Exact solution of some Turán-type problems , 1987, J. Comb. Theory, Ser. A.
[14] Miklós Simonovits,et al. Compactness results in extremal graph theory , 1982, Comb..
[15] Béla Bollobás,et al. Three-graphs without two triples whose symmetric difference is contained in a third , 1974, Discret. Math..