Alon, N.; Erdős, P.; Gunderson, D. S.; Molloy, M. A Ramsey-type problem and the Turán numbers. (English) Zbl 0996.05076 J. Graph Theory 40, No. 2, 120-129 (2002). Reviewer: Ko-Wei Lih (Nankang) MSC: 05C35 05C55 05D10 PDFBibTeX XMLCite \textit{N. Alon} et al., J. Graph Theory 40, No. 2, 120--129 (2002; Zbl 0996.05076) Full Text: DOI
Erdős, Paul; Hajnal, A.; Pach, János On a metric generalization of Ramsey’s theorem. (English) Zbl 0884.05092 Isr. J. Math. 102, 283-295 (1997). Reviewer: P.L.Erdös (Budapest) MSC: 05D10 PDFBibTeX XMLCite \textit{P. Erdős} et al., Isr. J. Math. 102, 283--295 (1997; Zbl 0884.05092) Full Text: DOI
Chen, Guantao; Erdős, Paul; Gyárfás, András; Schelp, R. H. A class of edge critical 4-chromatic graphs. (English) Zbl 0881.05044 Graphs Comb. 13, No. 2, 139-146 (1997). Reviewer: D.Cvetković (Beograd) MSC: 05C15 PDFBibTeX XMLCite \textit{G. Chen} et al., Graphs Comb. 13, No. 2, 139--146 (1997; Zbl 0881.05044) Full Text: DOI
Erdős, Paul; Gyárfás, András; Łuczak, Tomasz Graphs in which each \(C_4\) spans \(K_4\). (English) Zbl 0854.05061 Discrete Math. 154, No. 1-3, 263-268 (1996). Reviewer: M.Škoviera (Bratislava) MSC: 05C35 PDFBibTeX XMLCite \textit{P. Erdős} et al., Discrete Math. 154, No. 1--3, 263--268 (1996; Zbl 0854.05061) Full Text: DOI
Erdős, Paul Problems and results in discrete mathematics. (English) Zbl 0818.52014 Discrete Math. 136, No. 1-3, 53-73 (1994). Reviewer: J.Linhart (Salzburg) MSC: 52C10 11B25 05D10 00A07 52-02 05C55 PDFBibTeX XMLCite \textit{P. Erdős}, Discrete Math. 136, No. 1--3, 53--73 (1994; Zbl 0818.52014) Full Text: DOI
Erdős, Paul; Hajnal, András; Simonovits, Miklós; Sós, Vera T.; Szemerédi, E. Turán-Ramsey theorems and \(K_p\)-independence numbers. (English) Zbl 0812.05031 Comb. Probab. Comput. 3, No. 3, 297-325 (1994). Reviewer: Z.Chen (Indianapolis) MSC: 05C35 05C55 05C15 05C50 PDFBibTeX XMLCite \textit{P. Erdős} et al., Comb. Probab. Comput. 3, No. 3, 297--325 (1994; Zbl 0812.05031) Full Text: DOI
Erdős, Paul Some of my favorite solved and unsolved problems in graph theory. (English) Zbl 0794.05054 Quaest. Math. 16, No. 3, 333-350 (1993). Reviewer: I.Tomescu (Bucureşti) MSC: 05C35 00A07 05C15 05C55 05C38 PDFBibTeX XMLCite \textit{P. Erdős}, Quaest. Math. 16, No. 3, 333--350 (1993; Zbl 0794.05054) Full Text: DOI
Erdős, Paul; Hajnal, András; Simonovits, Miklós.; Sós, V. T.; Szemerédi, E. Turán-Ramsey theorems and simple asymptotically extremal structures. (English) Zbl 0774.05050 Combinatorica 13, No. 1, 31-56 (1993). Reviewer: W.G.Brown (Montreal) MSC: 05C35 05C55 05C38 PDFBibTeX XMLCite \textit{P. Erdős} et al., Combinatorica 13, No. 1, 31--56 (1993; Zbl 0774.05050) Full Text: DOI
Erdős, Paul; Gyárfás, A.; Pyber, L. Vertex coverings by monochromatic cycles and trees. (English) Zbl 0766.05062 J. Comb. Theory, Ser. B 51, No. 1, 90-95 (1991). Reviewer: R.C.Entringer (Albuquerque) MSC: 05C70 05C38 05C05 05C15 PDFBibTeX XMLCite \textit{P. Erdős} et al., J. Comb. Theory, Ser. B 51, No. 1, 90--95 (1991; Zbl 0766.05062) Full Text: DOI
Erdős, Paul; Galvin, Fred Some Ramsey-type theorems. (English) Zbl 0759.05095 Discrete Math. 87, No. 3, 261-269 (1991). Reviewer: J.E.Graver (Syracuse) MSC: 05D10 PDFBibTeX XMLCite \textit{P. Erdős} and \textit{F. Galvin}, Discrete Math. 87, No. 3, 261--269 (1991; Zbl 0759.05095) Full Text: DOI
Erdős, Paul; Füredi, Zoltán; Tuza, Zsolt Saturated \(r\)-uniform hypergraphs. (English) Zbl 0766.05060 Discrete Math. 98, No. 2, 95-104 (1991). MSC: 05C65 05C35 PDFBibTeX XMLCite \textit{P. Erdős} et al., Discrete Math. 98, No. 2, 95--104 (1991; Zbl 0766.05060) Full Text: DOI Backlinks: MO
Erdős, Paul; Komjáth, P. Countable decompositions of \({\mathbb{R}}^2\) and \({\mathbb{R}}^3\). (English) Zbl 0723.52005 Discrete Comput. Geom. 5, No. 4, 325-331 (1990). Reviewer: E.J.F.Primrose (Leicester) MSC: 52C10 51M15 PDFBibTeX XMLCite \textit{P. Erdős} and \textit{P. Komjáth}, Discrete Comput. Geom. 5, No. 4, 325--331 (1990; Zbl 0723.52005) Full Text: DOI
Erdős, Paul; Hajnal, András Ramsey-type theorems. (English) Zbl 0715.05052 Discrete Appl. Math. 25, No. 1-2, 37-52 (1989). Reviewer: J.E.Graver MSC: 05C55 05A17 05C65 PDFBibTeX XMLCite \textit{P. Erdős} and \textit{A. Hajnal}, Discrete Appl. Math. 25, No. 1--2, 37--52 (1989; Zbl 0715.05052) Full Text: DOI
Erdős, Paul; Faudree, Ralph J.; Pach, János; Spencer, Joel How to make a graph bipartite. (English) Zbl 0729.05025 J. Comb. Theory, Ser. B 45, No. 1, 86-98 (1988). Reviewer: A.Rosa (Hamilton/Ontario) MSC: 05C35 05C99 PDFBibTeX XMLCite \textit{P. Erdős} et al., J. Comb. Theory, Ser. B 45, No. 1, 86--98 (1988; Zbl 0729.05025) Full Text: DOI
Erdős, Paul; Füredi, Z.; Hajnal, András; Komjáth, P.; Rödl, Vojtěch; Seress, Á. Coloring graphs with locally few colors. (English) Zbl 0591.05030 Discrete Math. 59, 21-34 (1986). Reviewer: I.Tomescu MSC: 05C15 PDFBibTeX XMLCite \textit{P. Erdős} et al., Discrete Math. 59, 21--34 (1986; Zbl 0591.05030) Full Text: DOI
Erdős, Paul; Hajnal, András Chromatic number of finite and infinite graphs and hypergraphs. (English) Zbl 0566.05029 Discrete Math. 53, 281-285 (1985). Reviewer: I.Tomescu MSC: 05C15 05C35 05-02 PDFBibTeX XMLCite \textit{P. Erdős} and \textit{A. Hajnal}, Discrete Math. 53, 281--285 (1985; Zbl 0566.05029) Full Text: DOI
Erdős, Paul; Sós, Vera T. On Ramsey - Turan type theorems for hypergraphs. (English) Zbl 0511.05049 Combinatorica 2, 289-295 (1982). Reviewer: L.Zaremba MSC: 05C65 05C35 05C55 PDFBibTeX XMLCite \textit{P. Erdős} and \textit{V. T. Sós}, Combinatorica 2, 289--295 (1982; Zbl 0511.05049) Full Text: DOI
Erdős, Paul Personal reminiscences and remarks on the mathematical work of Tibor Gallai. (English) Zbl 0505.01012 Combinatorica 2, 207-212 (1982). MSC: 01A70 PDFBibTeX XMLCite \textit{P. Erdős}, Combinatorica 2, 207--212 (1982; Zbl 0505.01012) Full Text: DOI
Erdős, Paul On the combinatorial problems which I would most like to see solved. (English) Zbl 0486.05001 Combinatorica 1, 25-42 (1981). MSC: 05-02 05Cxx 05Bxx 11B75 03E05 00A07 PDFBibTeX XMLCite \textit{P. Erdős}, Combinatorica 1, 25--42 (1981; Zbl 0486.05001) Full Text: DOI
Erdős, Paul; Hajnal, András Embedding theorems for graphs establishing negative partition relations. (English) Zbl 0381.04004 Period. Math. Hung. 9, 205-230 (1978). Reviewer: N.H.Williams MSC: 03E05 03E30 05C99 PDFBibTeX XMLCite \textit{P. Erdős} and \textit{A. Hajnal}, Period. Math. Hung. 9, 205--230 (1978; Zbl 0381.04004) Full Text: DOI
Erdős, Paul; Hajnal, András; Milner, E. C. On set systems having paradoxical covering properties. (English) Zbl 0378.04002 Acta Math. Acad. Sci. Hung. 31, 89-124 (1978). Reviewer: P.L.Ferrari MSC: 03E05 05A17 03E55 PDFBibTeX XMLCite \textit{P. Erdős} et al., Acta Math. Acad. Sci. Hung. 31, 89--124 (1978; Zbl 0378.04002) Full Text: DOI
Cates, M.; Erdős, Paul; Hindman, N.; Rothschild, B. Partition theorems for subsets of vector spaces. (English) Zbl 0363.04009 J. Comb. Theory, Ser. A 20, 279-291 (1976). Reviewer: D.Kurepa MSC: 03E05 PDFBibTeX XMLCite \textit{M. Cates} et al., J. Comb. Theory, Ser. A 20, 279--291 (1976; Zbl 0363.04009) Full Text: DOI
Erdős, Paul; Milner, E. C.; Rado, R. Intersection theorems for systems of sets. III. (English) Zbl 0331.04002 J. Aust. Math. Soc. 18, 22-40 (1974). Reviewer: E.Harzheim MSC: 03E05 05A05 PDFBibTeX XMLCite \textit{P. Erdős} et al., J. Aust. Math. Soc. 18, 22--40 (1974; Zbl 0331.04002) Full Text: DOI
Erdős, Paul; Selfridge, J. L. On a combinatorial game. (English) Zbl 0293.05004 J. Comb. Theory, Ser. A 14, 298-301 (1973). Reviewer: W.Vogel MSC: 05A05 91A05 91A43 91A46 05C30 PDFBibTeX XMLCite \textit{P. Erdős} and \textit{J. L. Selfridge}, J. Comb. Theory, Ser. A 14, 298--301 (1973; Zbl 0293.05004) Full Text: DOI
Erdős, Paul; Fried, E.; Hajnal, András; Milner, E. C. Some remarks on simple tournaments. (English) Zbl 0267.05104 Algebra Univers. 2, 238-245 (1972). Reviewer: J.W.Moon MSC: 05C20 PDFBibTeX XMLCite \textit{P. Erdős} et al., Algebra Univers. 2, 238--245 (1972; Zbl 0267.05104) Full Text: DOI
Erdős, Paul; Shelah, Saharon Separability properties of almost-disjoint families of sets. (English) Zbl 0246.05002 Isr. J. Math. 12, 207-214 (1972). MSC: 05A05 03E05 PDFBibTeX XMLCite \textit{P. Erdős} and \textit{S. Shelah}, Isr. J. Math. 12, 207--214 (1972; Zbl 0246.05002) Full Text: DOI Backlinks: MO
Erdős, Paul; Szemerédi, E. On a Ramsey type theorem. (English) Zbl 0242.05122 Period. Math. Hung. 2, 295-299 (1972). Reviewer: J. E. Graver MSC: 05C15 05C35 PDFBibTeX XMLCite \textit{P. Erdős} and \textit{E. Szemerédi}, Period. Math. Hung. 2, 295--299 (1972; Zbl 0242.05122) Full Text: DOI
Erdős, Paul; Hajnal, András Ordinary partition relations for ordinal numbers. (English) Zbl 0257.04004 Period. Math. Hung. 1, 171-185 (1971). Reviewer: E.C.Milner MSC: 03E05 05A17 PDFBibTeX XMLCite \textit{P. Erdős} and \textit{A. Hajnal}, Period. Math. Hung. 1, 171--185 (1971; Zbl 0257.04004) Full Text: DOI
Erdős, Paul; Hajnal, András Some results and problems on certain polarized partitions. (English) Zbl 0214.02703 Acta Math. Acad. Sci. Hung. 21, 369-392 (1970). MSC: 05A18 00A07 PDFBibTeX XMLCite \textit{P. Erdős} and \textit{A. Hajnal}, Acta Math. Acad. Sci. Hung. 21, 369--392 (1970; Zbl 0214.02703) Full Text: DOI
Erdős, Pál; Hajnal, András; Milner, E. C. A problem on well ordered sets. (English) Zbl 0193.30803 Acta Math. Acad. Sci. Hung. 20, 323-329 (1969). Reviewer: E.Harzheim MSC: 05D05 03E10 PDFBibTeX XMLCite \textit{P. Erdős} et al., Acta Math. Acad. Sci. Hung. 20, 323--329 (1969; Zbl 0193.30803) Full Text: DOI
Erdős, Pál; Hajnal, András; Milner, E. C. On sets of almost disjoint subsets of a set. (English) Zbl 0174.01804 Acta Math. Acad. Sci. Hung. 19, 209-218 (1968). Reviewer: D.Kleitman MSC: 05D15 03E05 PDFBibTeX XMLCite \textit{P. Erdős} et al., Acta Math. Acad. Sci. Hung. 19, 209--218 (1968; Zbl 0174.01804) Full Text: DOI
Erdős, Pál; Hajnal, András On decomposition of graphs. (English) Zbl 0169.26601 Acta Math. Acad. Sci. Hung. 18, 359-377 (1967). Reviewer: H.A.Jung MSC: 05C70 PDFBibTeX XMLCite \textit{P. Erdős} and \textit{A. Hajnal}, Acta Math. Acad. Sci. Hung. 18, 359--377 (1967; Zbl 0169.26601) Full Text: DOI
Erdős, Pál; Hajnal, András; Milner, E. C. On the complete subgraphs of graphs defined by systems of sets. (English) Zbl 0151.33702 Acta Math. Acad. Sci. Hung. 17, 159-229 (1966). Reviewer: H.A.Jung PDFBibTeX XMLCite \textit{P. Erdős} et al., Acta Math. Acad. Sci. Hung. 17, 159--229 (1966; Zbl 0151.33702) Full Text: DOI
Erdős, Pál; Hajnal, András On chromatic number of graphs and setsystems. (English) Zbl 0151.33701 Acta Math. Acad. Sci. Hung. 17, 61-99 (1966). Reviewer: H.A.Jung MSC: 05C15 PDFBibTeX XMLCite \textit{P. Erdős} and \textit{A. Hajnal}, Acta Math. Acad. Sci. Hung. 17, 61--99 (1966; Zbl 0151.33701) Full Text: DOI
Erdős, Pál; Hajnal, András; Rado, R. Partition relations for cardinal numbers. (English) Zbl 0158.26603 Acta Math. Acad. Sci. Hung. 16, 93-196 (1965). Reviewer: L.Bukovský MSC: 05D10 03E05 03-02 05E10 03E10 PDFBibTeX XMLCite \textit{P. Erdős} et al., Acta Math. Acad. Sci. Hung. 16, 93--196 (1965; Zbl 0158.26603) Full Text: DOI
Erdős, Paul On a combinatorial problem. II. (English) Zbl 0201.33704 Acta Math. Acad. Sci. Hung. 15, 445-447 (1964). Reviewer: W.Moser MSC: 05D05 03E05 PDFBibTeX XMLCite \textit{P. Erdős}, Acta Math. Acad. Sci. Hung. 15, 445--447 (1964; Zbl 0201.33704) Full Text: DOI
Erdős, Pál; Hajnal, András Some remarks concerning our paper ’On the structure of set-mappings’. Non-existence of a two-valued \(\sigma\)-measure for the first uncountable inaccessible cardinal. (English) Zbl 0134.01602 Acta Math. Acad. Sci. Hung. 13, 223-226 (1962). Reviewer: E.Mendelsohn MSC: 05D10 03E55 03E05 05E05 03E10 PDFBibTeX XMLCite \textit{P. Erdős} and \textit{A. Hajnal}, Acta Math. Acad. Sci. Hung. 13, 223--226 (1962; Zbl 0134.01602) Full Text: DOI
Erdős, Paul; Hajnal, András On a property of families of sets. (English) Zbl 0201.32801 Acta Math. Acad. Sci. Hung. 12, 87-123 (1961). Reviewer: M.Krieger MSC: 05D05 03E05 PDFBibTeX XMLCite \textit{P. Erdős} and \textit{A. Hajnal}, Acta Math. Acad. Sci. Hung. 12, 87--123 (1961; Zbl 0201.32801) Full Text: DOI