What people are saying - Write a review
We haven't found any reviews in the usual places.
Extremal problems for hypergraphs
Applications of Ramsey style theorems
FOUNDATIONS PARTITIONS AND COMBINATORIAL GEOMETRY
2 other sections not shown
A A B adjacent ALGOL 60 antichains argument binomial coefficients bipartite graphs CENTRE TRACTS 56 cl(H clique coefficients color combinatorial geometry Combinatorial Theory condition conjecture consider contains copy of H corollary D.J. Kleitman DAYKIN defined DILWORTH's theorem direct product Discrete Math disjoint divisors edge-transitive edges eigenvalues elements equivalent ERDOS example exists finite graph finite set fixed geometry given graph G graph theory Hence hypergraph implies induced subgraph inequality integers isomorphic k-graph k-saturated partitions KATONA KLEITMAN lattice linear equations logarithmic convexity LUBELL LYM property MATHEMATICAL CENTRE TRACTS matrix maximal chains maximal number maximum members of F non-negative integers normalized matching number of pairs obtained partially ordered set polynomial positive integers problems Proc proof of theorem Proposition prove question R-property RADO Ramsey's Theorem reciprocity theorems result rows sequence Sperner k-families SPERNER's theorem submatrix subsets symmetric theorem 2.1 valence vertex set vertices