On hypergraphs without loose cycles
暂无分享,去创建一个
[1] Aaas News,et al. Book Reviews , 1893, Buffalo Medical and Surgical Journal.
[2] David Saxton,et al. The number of $C_{2l}$-free graphs , 2013, 1309.2927.
[3] Peter Frankl,et al. Counting Intersecting and Pairs of Cross-Intersecting Families , 2018, Comb. Probab. Comput..
[4] alcun K. grafo. ASYMPTOTIC ENUMERATION OF Kn-FREE GRAPHS , 2004 .
[5] Hong Liu,et al. Intersecting families of discrete structures are typically trivial , 2015, J. Comb. Theory, Ser. A.
[6] Dhruv Mubayi,et al. The Number of Triple Systems Without Even Cycles , 2017, Comb..
[7] Anusch Taraz,et al. Asymptotic enumeration, global structure, and constrained evolution , 2001, Discret. Math..
[8] Alexandr V. Kostochka,et al. Turán problems and shadows I: Paths and cycles , 2013, J. Comb. Theory, Ser. A.
[9] Zoltán Füredi,et al. Hypergraph Turán numbers of linear cycles , 2014, J. Comb. Theory, Ser. A.