论文信息 - The asymptotic number of triple systems not containing a fixed one

The asymptotic number of triple systems not containing a fixed one

Abstract For a fixed 3-uniform hypergraph F , call a hypergraph F -free if it contains no subhypergraph isomorphic to F . Let ex (n, F ) denote the size of a largest F -free hypergraph G ⊆[n] 3 . Let F n ( F ) denote the number of distinct labelled F -free G ⊆[n] 3 . We show that F n ( F )=2 ex (n, F )+ o (n 3 ) , and discuss related problems.

Vojtech Rödl | Brendan Nagle

[1] A. R. Rao,et al. An extremal problem in graph theory , 1968, Journal of the Australian Mathematical Society.

[2] E. Szemerédi. Regular Partitions of Graphs , 1975 .

[3] P. Erdös,et al. On the structure of linear graphs , 1946 .

[4] V. E. Alekseev. On the entropy values of hereditary classes of graphs , 1993 .

[5] D. J. Kleitman,et al. The Asymptotic Number of Lattices , 1980 .

[6] P. Erdös. On extremal problems of graphs and generalized graphs , 1964 .

[7] P. Erdös. On the structure of linear graphs , 1946 .

[8] Vojtech Rödl,et al. The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent , 1986, Graphs Comb..

[9] B. Bollobás. Combinatorics: Set Systems, Hypergraphs, Families of Vectors and Combinatorial Probability , 1986 .

[10] V. Rödl,et al. Extremal problems on set systems , 2002 .

[11] Paul Erdös,et al. On an extremal problem in graph theory , 1970 .

[12] M. Simonovits,et al. Szemeredi''s Regularity Lemma and its applications in graph theory , 1995 .