Combinatorics Probability Computing · 2009 · 70 citations · 8 references
Natural SciencesComputer ScienceMathematicsCombinatoricsProbability TheorySet TheoryCombinatorial Set TheoryEnumerative CombinatoricsExtremal CombinatoricsGraph TheoryProbabilistic CombinatoricsExtremal Set Theory
Let ⊂ 2 [ n ] be a family of subsets of {1, 2,. . ., n }. For any poset H , we say is H -free if does not contain any subposet isomorphic to H . Katona and others have investigated the behaviour of La( n , H ), which denotes the maximum size of H -free families ⊂ 2 [ n ] . Here we use a new approach, which is to apply methods from extremal graph theory and probability theory to identify new classes of posets H , for which La( n , H ) can be determined asymptotically as n → ∞ for various posets H , including two-end-forks, up-down trees, and cycles C 4 k on two levels.
8
On the structure of linear graphs
Paul Erdős, A. H. Stone · Bulletin of the American Mathematical Society · 1946 · 866 citations · Full text
On a lemma of Littlewood and Offord
P. Erdös · Bulletin of the American Mathematical Society · 1945 · 457 citations · Full text
Largest Families Without an r-Fork
Annalisa De Bonis, Gyula O. H. Katona · Order · 2007 · 57 citations