论文信息 - l-trace k-Sperner families of sets

l-trace k-Sperner families of sets

A family of sets [email protected]?2^X is defined to be l-trace k-Sperner if for any subset Y of X with size l the trace of F on Y (the restriction of F to Y) does not contain any chain of length k+1. In this paper we investigate the maximum size that an l-trace k-Sperner family (with underlying set [n]={1,2,...,n}) can have for various values of k, l and n.

Balázs Patkós | Balázs Patkós

[1] Zoltán Füredi,et al. Traces of finite sets: extremal problems and geometric applications , 1994 .

[2] Vladimir Vapnik,et al. Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .

[3] Norbert Sauer,et al. On the Density of Families of Sets , 1972, J. Comb. Theory A.

[4] Gyula O. H. Katona,et al. No four subsets forming an N , 2008, J. Comb. Theory, Ser. A.

[5] P. Erdos-L Lovász. Problems and Results on 3-chromatic Hypergraphs and Some Related Questions , 2022 .

[6] Béla Bollobás,et al. Defect Sauer Results , 1995, J. Comb. Theory A.

[7] E. Sperner. Ein Satz über Untermengen einer endlichen Menge , 1928 .

[8] Koichiro Yamamoto. Logarithmic order of free distributive lattice , 1954 .

[9] D. Lubell. A Short Proof of Sperner’s Lemma , 1966 .

[10] Béla Bollobás,et al. Reverse Kleitman Inequalities , 1989 .

[11] Béla Bollobás,et al. Unavoidable Traces Of Set Systems , 2005, Comb..

[12] L. D. Meshalkin. Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set , 1963 .

[13] Benny Sudakov,et al. Disjoint representability of sets and their complements , 2005, J. Comb. Theory, Ser. B.

[14] S. Shelah. A combinatorial problem; stability and order for models and theories in infinitary languages. , 1972 .