On Triple Systems with Independent Neighbourhoods
暂无分享,去创建一个
[1] Miklós Simonovits,et al. On a valence problem in extremal graph theory , 1973, Discret. Math..
[2] Béla Bollobás,et al. Three-graphs without two triples whose symmetric difference is contained in a third , 1974, Discret. Math..
[3] Paul Erdös,et al. On the connection between chromatic number, maximal clique and minimal degree of a graph , 1974, Discret. Math..
[4] József Dénes,et al. Research problems , 1980, Eur. J. Comb..
[5] Alexandr V. Kostochka. A class of constructions for turán’s (3, 4)-problem , 1982, Comb..
[6] Paul Erdös,et al. On Ramsey—Turán type theorems for hypergraphs , 1982, Comb..
[7] W. G. Brown. On an open problem of Paul Turan concerning 3-graphs , 1983 .
[8] Peter Frankl. Asymptotic solution of a turán-type problem , 1990, Graphs Comb..
[9] Zoltán Füredi,et al. The Maximum Size of 3-Uniform Hypergraphs Not Containing a Fano Plane , 2000, J. Comb. Theory, Ser. B.
[10] Vojtech Rödl,et al. On the Turán Number of Triple Systems , 2002, J. Comb. Theory, Ser. A.
[11] Zoltán Füredi,et al. Turán problems for integer‐weighted graphs , 2002, J. Graph Theory.
[12] Miklós Simonovits,et al. The Tura'n Density of the Hypergraph {abc, ade, bde, cde} , 2003, Electron. J. Comb..
[13] Dhruv Mubayi,et al. Stability theorems for cancellative hypergraphs , 2004, J. Comb. Theory, Ser. B.
[14] Benny Sudakov,et al. The Turán Number Of The Fano Plane , 2005, Comb..
[15] Benny Sudakov,et al. On A Hypergraph Turán Problem Of Frankl , 2005, Comb..
[16] Miklós Simonovits,et al. Triple Systems Not Containing a Fano Configuration , 2005, Comb. Probab. Comput..
[17] P. Erdos,et al. Problems and Results on Ranssey-turan Type Theorems Preliminary Report , 2022 .