Extremal Problems for Sets Forming Boolean Algebras and Complete Partite Hypergraphs

Journal of Combinatorial Theory. Series A

Volumn 88, Issue 2, 1999, Pages 342-367

  Gunderson, David S ^a   Rödl, Vojtěch ^b   Sidorenko, Alexander ^c  

^a MCMASTER UNIVERSITY   (Canada)

^b EMORY UNIVERSITY   (United States)

^c NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000946216     PISSN: 00973165     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcta.1999.2973     Document Type: Article

References (46)

1. Aigner M. Lexicographic matching in Boolean algebras. J. Combin. Theory Ser. B. 14:1973;187-194.
2. Aigner M. Combinatorial Theory. Grundlehren der Mathematischen Wissenschaften. 234:1979;Springer-Verlag, New York.
3. Aigner M., Duffus D., Kleitman D. Partitioning the power set into union-free classes. Discrete Math. 88:1991;113-119.
4. Apostol T. M. Introduction to Analytic Number Theory. Undergraduate Texts in Mathematics. 1976;Springer-Verlag, New York.
5. Behrend F. A. On sets of integers which contain no three elements in arithmetic progression. Proc. Nat. Acad. Sci. 23:1946;331-332.
6. Bollobás B. Extremal Graph Theory. 1979;Academic Press, New York.
7. n. J. Graph Theory. 19:1995;17-23.
8. Brown W. G. On graphs that do not contain a Thomsen graph. Canad. Math. Bull. 9:1966;281-285.
9. Brown T. C., Chung F. R. K., Erdos P., Graham R. L. Quantitative forms of a theorem of Hilbert. J. Combin. Theory Ser. A. 38:1985;210-216.
10. Cameron P. J. Combinatorics: Topics, Techniques, Algorithms. 1994;Cambridge Univ. Press, Cambridge.
11. Chung F. R. K., Graham R. L. On multicolor Ramsey numbers for complete bipartite graphs. J. Combin. Theory Ser. A. 18:1975;164-169.
12. n using symmetric chains. J. Combin. Theory Ser. A. 65:1994;151-157.
13. Erdos P. On sequences of integers no one of which divides the product of two others and on some related problems. Izv. Nauk Mat. i Mech. Tomsk. 2:1938;74-82.
14. Erdos P. Graph theory and probability. Canad. J. Math. 11:1959;34-38.
15. Erdos P. On extremal problems of graphs and generalized graphs. Israel J. Math. 2:1964;183-190.
16. Erdos P., Kleitman D. On collections of subsets containing no 4-member Boolean algebra. Proc. Amer. Math. Soc. 28:1971;87-90.
17. P. Erdos, A. Rényi, and V. Sós, On a problem of graph theory, Studia Sci. Math. Hungar.1, 215-235.
18. Erdos P., Shelah S. On problems of Moser and Hanson. Graph Theory and Applications. Lecture Notes in Math. 303:1972;Springer-Verlag, New York/Berlin. p. 75-79.
19. Erdos P., Simonovits M. Some extremal problems in graph theory. Combinatorial Theory and Its Appl. I. Proc. Colloq. Math. Soc. János Bolyai. 4:1970;North-Holland, Amsterdam. p. 378-392.
20. Erdos P., Spencer J. Probabilistic Methods in Combinatorics. 1974;Academic Press, London/New York.
21. Erdos P., Turán P. On a problem of Sidon in additive number theory, and on some related problems. J. London Math. Soc. 16:1941;212-215.
22. Frankl P., Füredi Z. Union-free families of sets and equations over fields. J. Number Theory. 23:1986;210-218.
23. Füredi Z. A Ramsey-Sperner theorem. Graphs Combin. 1:1985;51-56.
24. Füredi Z. Turán type problems. Keedwell A. D. Surveys in Combinatorics, 1991. London Math. Soc. Lecture Notes. 166:1991;253-300 Cambridge Univ. Press, Cambridge.
25. Füredi Z. On the number of edges of quadrilateral-free graphs. J. Combin Theory Ser. B. 68:1996;1-6.
26. Füredi Z., Griggs J., Odlyzko A., Shearer J. Ramsey-Sperner theory. Discrete Math. 63:1987;143-152.
27. Furstenberg H. Recurrent ergodic structures and Ramsey theory. Proceedings of the International Congress of Mathematicians, Kyoto, 1990. 1991;Math. Soc. Japan, Tokyo. p. 1057-1069.
28. Furstenberg H., Katznelson Y. A density version of the Hales-Jewett theorem. J. d'Anal. Math. 57:1991;64-119.
29. Graham R. L. Rudiments of Ramsey Theory. Regional Conference Series in Math. 45:1981;Amer. Math. Soc. Providence.
30. Graham R. L., Rödl V. Numbers in Ramsey theory. Whitehead C. Surveys in Combinatorics, 1987. London Math. Soc. Lecture Note Series. 123:1987;111-153 Cambridge Univ. Press, Cambridge.
31. Greene C., Kleitman D. J. Strong versions of Sperner's theorem. J. Combin. Theory Ser. A. 20:1976;80-88.
32. Greene C., Kleitman D. J. Proof techniques in the theory of finite sets. Rota C. Studies in Combinatorics. MAA Studies in Mathematics. 17:1978.
33. Gunderson D. S. Extremal properties for Boolean Algebras, Sum-Sets, and Hypergraphs. 1995;Emory University, Atlanta.
34. Gunderson D. S., Rödl V. Extremal properties for affine cubes of integers. Combin. Probab. Comput. 7:1998;65-79.
35. Hales A. W., Jewett R. I. Regularity and positional games. Trans. Amer. Math. Soc. 106:1963;222-229.
36. Hilbert D. Über die Irreduzibilität ganzer rationaler Funktionen mit ganzzahligen Koeffizienten. J. Reine Angew. Math. 110:1892;104-129.
37. Koubek V., Rödl V. On number of covering arcs in orderings. Comment. Math. Univ. Carolin. 22:1981;721-733.
38. Kovári T., Sós V. T., Turán P. On a problem of K. Zarankiewicz. Colloq. Math. 3:1954;50-57.
39. Lovász L. Combinatorial Problems and Exercises. 1979;North-Holland, New York.
40. Lubell D. A short proof of Sperner's lemma. J. Combin. Theory. 1:1966;299.
41. Reiman I. Über ein Problem von K. Zarankiewicz. Acta Math. Acad. Sci. Hung. 9:1959;269-279.
42. Rödl V. Note on finite Boolean algebras. Acta Polytech. 1982;47-49.
43. Simonovits M. Extremal graph theory. Beineke L. W., Wilson R. J. Selected Topics in Graph Theory 2. 1983;161-200 Academic Press, New York.
44. Singer J. A theorem in finite projective geometry. Trans. Amer. Math. Soc. 43:1938;377-385.
45. Szemerédi E. On sets of integers containing no four elements in arithmetic progression. Acta Math. Acad. Sci. Hungar. 20:1969;199-245.
46. B. Voigt, personal communication with V. Rödl, Prague, 1981.