Erdős, Paul; Galvin, David P.; Galvin, Fred; Krieger, Michael M. Factoring complete graphs and hypergraphs into factors with few maximal cliques. arXiv:2309.03083 Preprint, arXiv:2309.03083 [math.CO] (2023). MSC: 05C69 05C65 BibTeX Cite \textit{P. Erdős} et al., ``Factoring complete graphs and hypergraphs into factors with few maximal cliques'', Preprint, arXiv:2309.03083 [math.CO] (2023) Full Text: arXiv OA License
Soifer, Alexander [Erdős, Paul; Grünbaum, Branko; Johnson, Peter D. jun.; Rousseau, Cecil] Geometric etudes in combinatorial mathematics. With forewords to the 1st edition by Paul Erdős, Branko Grünbaum, and Cecil Rousseau. With new forewords to the 2nd edition by Branko Grünbaum, Peter D. Johnson jun. and Cecil Rousseau. 2nd updated and expanded ed. (English) Zbl 1203.52007 New York, NY: Springer (ISBN 978-0-387-75469-7/pbk; 978-0-387-75470-3/ebook). xxxv, 261 p. (2010). Reviewer: Marek Lassak (Bydgoszcz) MSC: 52A37 52-01 52A10 52A35 52C20 05B50 52C99 00A09 05-01 05C55 PDFBibTeX XMLCite \textit{A. Soifer}, Geometric etudes in combinatorial mathematics. With forewords to the 1st edition by Paul Erdős, Branko Grünbaum, and Cecil Rousseau. With new forewords to the 2nd edition by Branko Grünbaum, Peter D. Johnson jun. and Cecil Rousseau. 2nd updated and expanded ed. New York, NY: Springer (2010; Zbl 1203.52007) Full Text: DOI
Soifer, Alexander [Engel, Philip L; Erdős, Paul; Grünbaum, Branko; Johnson, Peter D. jun.; Rousseau, Cecil] How does one cut a triangle? With forewords by Philip L. Engel, Paul Erdős, Branko Grünbaum, Peter D. Johnson jun. and Cecil Rousseau. 2nd ed. (English) Zbl 1180.52001 New York, NY: Springer (ISBN 978-0-387-74650-0/pbk; 978-0-387-74652-4/ebook). xxx, 174 p. (2009). Reviewer: Victor V. Pambuccian (Phoenix) MSC: 52-01 51M04 51M16 52A10 52C15 05-01 52C10 51-01 PDFBibTeX XMLCite \textit{A. Soifer}, How does one cut a triangle? With forewords by Philip L. Engel, Paul Erdős, Branko Grünbaum, Peter D. Johnson jun. and Cecil Rousseau. 2nd ed. New York, NY: Springer (2009; Zbl 1180.52001) Full Text: DOI
Erdős, Paul; Kleitman, Daniel J. Extremal problems among subsets of a set. (Reprint). (English) Zbl 1105.05069 Discrete Math. 306, No. 10-11, 923-931 (2006). Reviewer: Sergej L. Bezrukov (Superior) MSC: 05D05 PDFBibTeX XMLCite \textit{P. Erdős} and \textit{D. J. Kleitman}, Discrete Math. 306, No. 10--11, 923--931 (2006; Zbl 1105.05069) Full Text: DOI
Erdős, P.; Meir, A.; Sós, V. T.; Turán, P. On some applications of graph theory. I. (Reprint). (English) Zbl 1095.05037 Discrete Math. 306, No. 10-11, 853-866 (2006). MSC: 05C90 PDFBibTeX XMLCite \textit{P. Erdős} et al., Discrete Math. 306, No. 10--11, 853--866 (2006; Zbl 1095.05037) Full Text: DOI
Duke, Richard A.; Erdős, Paul; Rödl, Vojtěch On large intersecting subfamilies of uniform setfamilies. (English) Zbl 1031.05128 Random Struct. Algorithms 23, No. 4, 351-356 (2003). MSC: 05E05 PDFBibTeX XMLCite \textit{R. A. Duke} et al., Random Struct. Algorithms 23, No. 4, 351--356 (2003; Zbl 1031.05128) Full Text: DOI
Erdős, Paul; Hedetniemi, Stephen T.; Laskar, Renu C.; Prins, Geert C. E. On the equality of the partial Grundy and upper ochromatic numbers of graphs. (English) Zbl 1028.05031 Discrete Math. 272, No. 1, 53-64 (2003). MSC: 05C15 PDFBibTeX XMLCite \textit{P. Erdős} et al., Discrete Math. 272, No. 1, 53--64 (2003; Zbl 1028.05031) Full Text: DOI
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; Faudree, Ralph; Ordman, Edward T. Blocking sets for paths of a given length. (English) Zbl 0990.05083 J. Comb. Math. Comb. Comput. 40, 65-78 (2002). Reviewer: Peter Horák (Safat) MSC: 05C38 05C35 PDFBibTeX XMLCite \textit{P. Erdős} et al., J. Comb. Math. Comb. Comput. 40, 65--78 (2002; Zbl 0990.05083)
Bollobás, B.; Erdős, P.; Faudree, R. J.; Rousseau, C. C.; Schelp, R. H. Random induced graphs. (English) Zbl 1038.05055 Discrete Math. 248, No. 1-3, 249-254 (2002). Reviewer: James G. Oxley (Baton Rouge) MSC: 05C80 PDFBibTeX XMLCite \textit{B. Bollobás} et al., Discrete Math. 248, No. 1--3, 249--254 (2002; Zbl 1038.05055) Full Text: DOI
Erdős, P.; Faudree, R. J.; Gould, R. J.; Jacobson, M. S.; Lehel, J. Edge disjoint monochromatic triangles in 2-colored graphs. (English) Zbl 0983.05034 Discrete Math. 231, No. 1-3, 135-141 (2001). Reviewer: Jack E.Graver (Syracuse) MSC: 05C15 05C35 05C55 PDFBibTeX XMLCite \textit{P. Erdős} et al., Discrete Math. 231, No. 1--3, 135--141 (2001; Zbl 0983.05034) Full Text: DOI
Alon, Noga; Spencer, Joel H. [Erdős, Paul] The probabilistic method. With an appendix on the life and work of Paul Erdős. 2nd ed. (English) Zbl 0996.05001 Wiley-Interscience Series in Discrete Mathematics and Optimization. Chichester: Wiley. xvi, 301 p. (2000). Reviewer: J.W.Moon (Edmonton) MSC: 05-02 05D40 PDFBibTeX XMLCite \textit{N. Alon} and \textit{J. H. Spencer}, The probabilistic method. With an appendix on the life and work of Paul Erdős. 2nd ed. Chichester: Wiley (2000; Zbl 0996.05001)
Erdős, Paul; Hajnal, András; Pach, János A Ramsey-type theorem for bipartite graphs. (English) Zbl 0978.05052 Geombinatorics 10, No. 2, 64-68 (2000). Reviewer: Jack E.Graver (Syracuse) MSC: 05C55 PDFBibTeX XMLCite \textit{P. Erdős} et al., Geombinatorics 10, No. 2, 64--68 (2000; Zbl 0978.05052)
Erdős, Paul; Pálfy, Péter P. On the orders of directly indecomposable groups. (English) Zbl 0939.11004 Discrete Math. 200, No. 1-3, 165-179 (1999). Reviewer: Y.O.Hamidoune (Paris) MSC: 11B05 05C25 20D60 PDFBibTeX XMLCite \textit{P. Erdős} and \textit{P. P. Pálfy}, Discrete Math. 200, No. 1--3, 165--179 (1999; Zbl 0939.11004) Full Text: DOI
Erdős, Paul; Harcos, Gergely; Pach, János Popular distances in 3-space. (English) Zbl 0957.52006 Discrete Math. 200, No. 1-3, 95-99 (1999). Reviewer: Erhard Quaisser (Potsdam) MSC: 52C10 05C35 52C35 PDFBibTeX XMLCite \textit{P. Erdős} et al., Discrete Math. 200, No. 1--3, 95--99 (1999; Zbl 0957.52006) Full Text: DOI
Erdős, Paul; Gyárfás, András Split and balanced colorings of complete graphs. (English) Zbl 0931.05031 Discrete Math. 200, No. 1-3, 79-86 (1999). Reviewer: R.J.Faudree (Memphis) MSC: 05C15 PDFBibTeX XMLCite \textit{P. Erdős} and \textit{A. Gyárfás}, Discrete Math. 200, No. 1--3, 79--86 (1999; Zbl 0931.05031) Full Text: DOI
Erdős, Paul; Füredi, Zoltán; Rothschild, Bruce L.; Sós, Vera T. Induced subgraphs of given sizes. (English) Zbl 0930.05052 Discrete Math. 200, No. 1-3, 61-77 (1999). Reviewer: W.G.Brown (Montreal) MSC: 05C35 PDFBibTeX XMLCite \textit{P. Erdős} et al., Discrete Math. 200, No. 1--3, 61--77 (1999; Zbl 0930.05052) Full Text: DOI
Erdős, Paul; Faudree, R. J.; Rousseau, C. C.; Schelp, R. H. The number of cycle lengths in graphs of given minimum degree and girth. (English) Zbl 0934.05076 Discrete Math. 200, No. 1-3, 55-60 (1999). Reviewer: L.A.Székely (Columbia/South Carolina) MSC: 05C35 05C38 PDFBibTeX XMLCite \textit{P. Erdős} et al., Discrete Math. 200, No. 1--3, 55--60 (1999; Zbl 0934.05076) Full Text: DOI
Deléglise, Marc; Erdős, Paul; Nicolas, Jean-Louis On the sets represented by the partitions of an integer \(n\). (Sur les ensembles représentés par les partitions d’un entier \(n\).) (French) Zbl 0976.11048 Discrete Math. 200, No. 1-3, 27-48 (1999). Reviewer: N.Robbins (San Francisco) MSC: 11P83 05A17 PDFBibTeX XMLCite \textit{M. Deléglise} et al., Discrete Math. 200, No. 1--3, 27--48 (1999; Zbl 0976.11048) Full Text: DOI
Bondy, J. A.; Erdős, Paul; Fajtlowicz, S. Graphs of diameter two with no 4-circuits. (English) Zbl 0930.05051 Discrete Math. 200, No. 1-3, 21-25 (1999). Reviewer: W.G.Brown (Montreal) MSC: 05C35 05B25 05C12 05C75 PDFBibTeX XMLCite \textit{J. A. Bondy} et al., Discrete Math. 200, No. 1--3, 21--25 (1999; Zbl 0930.05051) Full Text: DOI
Bollobás, Béla; Erdős, Paul; Sarkar, Amites Extremal graphs for weights. (English) Zbl 0933.05081 Discrete Math. 200, No. 1-3, 5-19 (1999). Reviewer: D.P.Brown (Carbondale) MSC: 05C35 PDFBibTeX XMLCite \textit{B. Bollobás} et al., Discrete Math. 200, No. 1--3, 5--19 (1999; Zbl 0933.05081) Full Text: DOI
Erdős, Paul A selection of problems and results in combinatorics. (English) Zbl 0924.05064 Comb. Probab. Comput. 8, No. 1-2, 1-6 (1999). Reviewer: R.J.Faudree (Memphis) MSC: 05C99 PDFBibTeX XMLCite \textit{P. Erdős}, Comb. Probab. Comput. 8, No. 1--2, 1--6 (1999; Zbl 0924.05064) Full Text: DOI
Erdős, Paul; Fowler, Tom Finding large \(p\)-colored diameter two subgraphs. (English) Zbl 0926.05016 Graphs Comb. 15, No. 1, 21-27 (1999). Reviewer: C.Jagger (Cambridge) MSC: 05C15 05C55 PDFBibTeX XMLCite \textit{P. Erdős} and \textit{T. Fowler}, Graphs Comb. 15, No. 1, 21--27 (1999; Zbl 0926.05016)
Bollobás, Béla; Erdős, Paul Graphs of extremal weights. (English) Zbl 0963.05068 Ars Comb. 50, 225-233 (1998). Reviewer: Martin Klazar (Praha) MSC: 05C35 05C07 PDFBibTeX XMLCite \textit{B. Bollobás} and \textit{P. Erdős}, Ars Comb. 50, 225--233 (1998; Zbl 0963.05068)
Chen, Guantao; Erdős, Paul; Shreve, Warren Ramsey numbers for irregular graphs. (English) Zbl 0952.05048 Congr. Numerantium 135, 139-145 (1998). MSC: 05C55 PDFBibTeX XMLCite \textit{G. Chen} et al., Congr. Numerantium 135, 139--145 (1998; Zbl 0952.05048)
Erdős, Paul; Gyárfás, András; Ruszinkó, Miklós How to decrease the diameter of triangle-free graphs. (English) Zbl 0924.05038 Combinatorica 18, No. 4, 493-501 (1998). Reviewer: Péter Komjáth (Budapest) MSC: 05C35 05C12 PDFBibTeX XMLCite \textit{P. Erdős} et al., Combinatorica 18, No. 4, 493--501 (1998; Zbl 0924.05038) Full Text: DOI
Erdős, Paul The probability method: Successes and limitations. (English) Zbl 0930.05096 J. Stat. Plann. Inference 72, No. 1-2, 207-213 (1998). Reviewer: J.E.Graver (Syracuse) MSC: 05D40 05C15 05C80 PDFBibTeX XMLCite \textit{P. Erdős}, J. Stat. Plann. Inference 72, No. 1--2, 207--213 (1998; Zbl 0930.05096) Full Text: DOI
Bergelson, Vitaly; Erdős, Paul; Hindman, Neil; Łuczak, Tomasz Dense difference sets and their combinatorial structure. (English) Zbl 0868.05009 Graham, Ronald L. (ed.) et al., The mathematics of Paul Erdős. Vol. I. Berlin: Springer, Algorithms Comb. 13, 165-175 (1997). Reviewer: V.D.Tonchev (Houghton) MSC: 05B10 11B75 PDFBibTeX XMLCite \textit{V. Bergelson} et al., Algorithms Comb. 13, 165--175 (1997; Zbl 0868.05009)
Erdős, Paul Some of my favorite problems and results. (English) Zbl 0871.11004 Graham, Ronald L. (ed.) et al., The mathematics of Paul Erdős. Vol. I. Berlin: Springer, Algorithms Comb. 13, 47-67 (1997). Reviewer: O.Ninnemann (Berlin) MSC: 11-02 51-02 00A07 05-02 11Bxx 11Nxx PDFBibTeX XMLCite \textit{P. Erdős}, Algorithms Comb. 13, 47--67 (1997; Zbl 0871.11004)
Erdős, Paul; Gyárfás, András A variant of the classical Ramsey problem. (English) Zbl 0910.05034 Combinatorica 17, No. 4, 459-467 (1997). Reviewer: Péter Komjáth (Budapest) MSC: 05C35 05C80 05D10 05C55 PDFBibTeX XMLCite \textit{P. Erdős} and \textit{A. Gyárfás}, Combinatorica 17, No. 4, 459--467 (1997; Zbl 0910.05034) Full Text: DOI
Alavi, Yousef; Erdős, Paul; Lam, Peter Che Bor; Lick, Don; Liu, Jiuqiang; Wang, Jianfang Upper bounds on linear vertex-arboricity of complementary graphs. (English) Zbl 0892.05023 Util. Math. 52, 43-48 (1997). Reviewer: Z.Chen (Indianapolis) MSC: 05C35 PDFBibTeX XMLCite \textit{Y. Alavi} et al., Util. Math. 52, 43--48 (1997; Zbl 0892.05023)
Erdős, Paul; Sarkozy, Gabor N. On cycles in the coprime graph of integers. (English) Zbl 0932.11013 Electron. J. Comb. 4, No. 2, Research paper R8, 11 p. (1997). MSC: 11B75 05C38 PDFBibTeX XMLCite \textit{P. Erdős} and \textit{G. N. Sarkozy}, Electron. J. Comb. 4, No. 2, Research paper R8, 11 p. (1997; Zbl 0932.11013) Full Text: EuDML EMIS
Erdős, Paul Some of my favourite unsolved problems. (English) Zbl 1044.11501 Math. Jap. 46, No. 3, 527-537 (1997). Reviewer: Olaf Ninnemann (Uffing am Staffelsee) MSC: 11-02 05-02 PDFBibTeX XMLCite \textit{P. Erdős}, Math. Japon. 46, No. 3, 527--537 (1997; Zbl 1044.11501)
Calkin, Neil J.; Erdős, Paul; Tovey, Craig A. New Ramsey bounds from cyclic graphs of prime order. (English) Zbl 0884.05064 SIAM J. Discrete Math. 10, No. 3, 381-387 (1997). MSC: 05C55 05D10 05C80 PDFBibTeX XMLCite \textit{N. J. Calkin} et al., SIAM J. Discrete Math. 10, No. 3, 381--387 (1997; Zbl 0884.05064) Full Text: DOI
Erdős, Paul; Gyárfás, András; Kohayakawa, Yoshiharu The size of the largest bipartite subgraphs. (English) Zbl 0888.05035 Discrete Math. 177, No. 1-3, 267-271 (1997). Reviewer: C.-Q.Zhang (Morgantown) MSC: 05C35 PDFBibTeX XMLCite \textit{P. Erdős} et al., Discrete Math. 177, No. 1--3, 267--271 (1997; Zbl 0888.05035) 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
Deuber, W. A.; Erdős, Paul; Gunderson, D. S.; Kostochka, A. V.; Meyer, A. G. Intersection statements for systems of sets. (English) Zbl 0883.05123 J. Comb. Theory, Ser. A 79, No. 1, 118-132 (1997). Reviewer: A.Vince (Gainesville) MSC: 05D05 PDFBibTeX XMLCite \textit{W. A. Deuber} et al., J. Comb. Theory, Ser. A 79, No. 1, 118--132 (1997; Zbl 0883.05123) Full Text: DOI
Erdős, Paul; Ordman, Edward T.; Zalcstein, Yechezkel Clique partitions of chordal graphs. (English) Zbl 0876.05051 Bollobás, Béla (ed.) et al., Combinatorics, geometry and probability. A tribute to Paul Erdős. Proceedings of the conference dedicated to Paul Erdős on the occasion of his 80th birthday, Cambridge, UK, 26 March 1993. Cambridge: Cambridge University Press, 291-297 (1997). MSC: 05C35 05C70 PDFBibTeX XMLCite \textit{P. Erdős} et al., in: Combinatorics, geometry and probability. A tribute to Paul Erdős. Proceedings of the conference dedicated to Paul Erdős on the occasion of his 80th birthday, Cambridge, UK, 26 March 1993. Cambridge: Cambridge University Press. 291--297 (1997; Zbl 0876.05051)
Erdős, Paul; Makai, Endre; Pach, János Nearly equal distances in the plane. (English) Zbl 0889.52017 Bollobás, Béla (ed.) et al., Combinatorics, geometry and probability. A tribute to Paul Erdős. Proceedings of the conference dedicated to Paul Erdős on the occasion of his 80th birthday, Cambridge, UK, 26 March 1993. Cambridge: Cambridge University Press. 283-290 (1997). Reviewer: Peter Braß (Berlin) MSC: 52C10 05C35 PDFBibTeX XMLCite \textit{P. Erdős} et al., in: Combinatorics, geometry and probability. A tribute to Paul Erdős. Proceedings of the conference dedicated to Paul Erdős on the occasion of his 80th birthday, Cambridge, UK, 26 March 1993. Cambridge: Cambridge University Press. 283--290 (1997; Zbl 0889.52017)
Erdős, Pál; Hajnal, András; Simonovits, Miklós; Sós, Vera T.; Szemerédi, Endre Turán-Ramsey theorems and \(K_p\)-independence numbers. (English) Zbl 0876.05050 Bollobás, Béla (ed.) et al., Combinatorics, geometry and probability. A tribute to Paul Erdős. Proceedings of the conference dedicated to Paul Erdős on the occasion of his 80th birthday, Cambridge, UK, 26 March 1993. Cambridge: Cambridge University Press, 253-281 (1997). MSC: 05C35 05C55 05C15 05C50 PDFBibTeX XMLCite \textit{P. Erdős} et al., in: Combinatorics, geometry and probability. A tribute to Paul Erdős. Proceedings of the conference dedicated to Paul Erdős on the occasion of his 80th birthday, Cambridge, UK, 26 March 1993. Cambridge: Cambridge University Press. 253--281 (1997; Zbl 0876.05050)
Erdős, Paul; Faudree, Ralph J.; Rousseau, C. C.; Schelp, R. H. Ramsey size linear graphs. (English) Zbl 0876.05071 Bollobás, Béla (ed.) et al., Combinatorics, geometry and probability. A tribute to Paul Erdős. Proceedings of the conference dedicated to Paul Erdős on the occasion of his 80th birthday, Cambridge, UK, 26 March 1993. Cambridge: Cambridge University Press, 241-251 (1997). MSC: 05C55 05C35 PDFBibTeX XMLCite \textit{P. Erdős} et al., in: Combinatorics, geometry and probability. A tribute to Paul Erdős. Proceedings of the conference dedicated to Paul Erdős on the occasion of his 80th birthday, Cambridge, UK, 26 March 1993. Cambridge: Cambridge University Press. 241--251 (1997; Zbl 0876.05071)
Erdős, Paul; Pyber, L. Covering a graph by complete bipartite graphs. (English) Zbl 0876.05080 Discrete Math. 170, No. 1-3, 249-251 (1997). MSC: 05C70 PDFBibTeX XMLCite \textit{P. Erdős} and \textit{L. Pyber}, Discrete Math. 170, No. 1--3, 249--251 (1997; Zbl 0876.05080) 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
Bollobás, Béla (ed.); Thomason, Andrew (ed.) [Erdős, Paul] Combinatorics, geometry and probability. A tribute to Paul Erdős. Proceedings of the conference dedicated to Paul Erdős on the occasion of his 80th birthday, Cambridge, UK, 26 March 1993. (English) Zbl 0865.00038 Cambridge: Cambridge University Press. xxi, 562 p. (1997). MSC: 00B25 05-06 52-06 60-06 PDFBibTeX XMLCite \textit{B. Bollobás} (ed.) and \textit{A. Thomason} (ed.), Combinatorics, geometry and probability. A tribute to Paul Erdős. Proceedings of the conference dedicated to Paul Erdős on the occasion of his 80th birthday, Cambridge, UK, 26 March 1993. Cambridge: Cambridge University Press (1997; Zbl 0865.00038)
Erdős, Paul Some old and new problems in various branches of combinatorics. (English) Zbl 0872.05020 Discrete Math. 165-166, 227-231 (1997). Reviewer: S.Stahl (Lawrence) MSC: 05C35 00A27 11B75 52C10 PDFBibTeX XMLCite \textit{P. Erdős}, Discrete Math. 165--166, 227--231 (1997; Zbl 0872.05020) Full Text: DOI
Erdős, Paul Some recent problems and results in graph theory. (English) Zbl 0871.05054 Discrete Math. 164, No. 1-3, 81-85 (1997). Reviewer: E.J.F.Primrose (Leicester) MSC: 05C99 00A07 05D99 PDFBibTeX XMLCite \textit{P. Erdős}, Discrete Math. 164, No. 1--3, 81--85 (1997; Zbl 0871.05054) Full Text: DOI
Erdős, Paul; Faudree, Ralph J.; Jagota, Arun; Łuczak, Tomasz Large subgraphs of minimal density or degree. (English) Zbl 0865.05052 J. Comb. Math. Comb. Comput. 22, 87-96 (1996). Reviewer: B.Andrásfai (Budapest) MSC: 05C35 PDFBibTeX XMLCite \textit{P. Erdős} et al., J. Comb. Math. Comb. Comput. 22, 87--96 (1996; Zbl 0865.05052)
Erdős, Paul; Reid, Talmage James; Schelp, Richard; Staton, William Sizes of graphs with induced subgraphs of large maximum degree. (English) Zbl 0858.05057 Discrete Math. 158, No. 1-3, 283-286 (1996). Reviewer: B.Zelinka (Liberec) MSC: 05C35 PDFBibTeX XMLCite \textit{P. Erdős} et al., Discrete Math. 158, No. 1--3, 283--286 (1996; Zbl 0858.05057) Full Text: DOI
Erdős, Pál; Hamburger, Peter; Pippert, Raymond E.; Weakley, William D. Hypercube subgraphs with minimal detours. (English) Zbl 0857.05027 J. Graph Theory 23, No. 2, 119-128 (1996). Reviewer: F.Plastria (Brussels) MSC: 05C12 05C35 68R10 PDFBibTeX XMLCite \textit{P. Erdős} et al., J. Graph Theory 23, No. 2, 119--128 (1996; Zbl 0857.05027) Full Text: DOI
Erdős, Paul; Tuza, Zsolt; Valtr, Pavel Ramsey-remainder. (English) Zbl 0858.05073 Eur. J. Comb. 17, No. 6, 519-532 (1996). Reviewer: R.Faudree (Memphis) MSC: 05C55 05D10 PDFBibTeX XMLCite \textit{P. Erdős} et al., Eur. J. Comb. 17, No. 6, 519--532 (1996; Zbl 0858.05073) Full Text: DOI
Alon, Noga; Erdős, Paul; Holzman, Ron; Krivelevich, Michael On \(k\)-saturated graphs with restrictions on the degrees. (English) Zbl 0857.05051 J. Graph Theory 23, No. 1, 1-20 (1996). Reviewer: C.Jagger (Cambridge) MSC: 05C35 05C65 PDFBibTeX XMLCite \textit{N. Alon} et al., J. Graph Theory 23, No. 1, 1--20 (1996; Zbl 0857.05051) 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; Graham, S. W.; Ivić, Aleksandar; Pomerance, Carl On the number of divisors of \(n!\). (English) Zbl 0858.11051 Berndt, Bruce C. (ed.) et al., Analytic number theory. Vol. 1. Proceedings of a conference in honor of Heini Halberstam, May 16-20, 1995, Urbana, IL, USA. Boston, MA: Birkhäuser, Prog. Math. 138, 337-355 (1996). Reviewer: E.J.Scourfield (Egham) MSC: 11N37 05A10 PDFBibTeX XMLCite \textit{P. Erdős} et al., Prog. Math. 138, 337--355 (1996; Zbl 0858.11051)
Erdős, Paul; Gallai, Tibor; Tuza, Zsolt Covering and independence in triangle structures. (English) Zbl 0857.05077 Discrete Math. 150, No. 1-3, 89-101 (1996). Reviewer: A.Vince (Gainesville) MSC: 05C70 05C35 05C55 PDFBibTeX XMLCite \textit{P. Erdős} et al., Discrete Math. 150, No. 1--3, 89--101 (1996; Zbl 0857.05077) Full Text: DOI
Erdős, Paul Some of my favourite problems on cycles and colourings. (English) Zbl 0846.05025 Tatra Mt. Math. Publ. 9, 7-9 (1996). MSC: 05C15 05C38 00A07 PDFBibTeX XMLCite \textit{P. Erdős}, Tatra Mt. Math. Publ. 9, 7--9 (1996; Zbl 0846.05025)
Erdős, Paul; Schönheim, J. Sets versus divisors. (English) Zbl 0845.05096 Miklós, D. (ed.) et al., Combinatorics, Paul Erdős is eighty. Vol. 2. Budapest: János Bolyai Mathematical Society, Bolyai Soc. Math. Stud. 2, 193-212 (1996). Reviewer: P.Komjáth (Budapest) MSC: 05D05 PDFBibTeX XMLCite \textit{P. Erdős} and \textit{J. Schönheim}, Bolyai Soc. Math. Stud. 2, 193--212 (1996; Zbl 0845.05096)
Erdős, Paul On some of my favourite theorems. (English) Zbl 0853.11001 Miklós, D. (ed.) et al., Combinatorics, Paul Erdős is eighty. Vol. 2. Budapest: János Bolyai Mathematical Society, Bolyai Soc. Math. Stud. 2, 97-132 (1996). Reviewer: E.Härtter (Mainz) MSC: 11-02 05-02 05C35 05C80 05D05 05D10 PDFBibTeX XMLCite \textit{P. Erdős}, Bolyai Soc. Math. Stud. 2, 97--132 (1996; Zbl 0853.11001)
Erdős, Paul; Janson, Svante; Łuczak, Tomasz; Spencer, Joel A note on triangle-free graphs. (English) Zbl 0842.05080 Aldous, David (ed.) et al., Random discrete structures. Based on a workshop held November 15-19, 1993 at IMA, University of Minnesota, Minneapolis, MN, USA. Berlin: Springer-Verlag, IMA Vol. Math. Appl. 76, 117-119 (1996). Reviewer: G.L.McColm (Tampa) MSC: 05C80 PDFBibTeX XMLCite \textit{P. Erdős} et al., IMA Vol. Math. Appl. 76, 117--119 (1996; Zbl 0842.05080)
Chen, Guantao; Erdős, Paul; Staton, William Proof of a conjecture of Bollobás on nested cycles. (English) Zbl 0835.05036 J. Comb. Theory, Ser. B 66, No. 1, 38-43 (1996). Reviewer: W.Staton (Mississippi) MSC: 05C38 05C35 PDFBibTeX XMLCite \textit{G. Chen} et al., J. Comb. Theory, Ser. B 66, No. 1, 38--43 (1996; Zbl 0835.05036) Full Text: DOI
Debose, Yolanda; Erdős, Paul; Hobbs, Arthur M. Graphs having no short even cycles. (English) Zbl 0896.05037 Congr. Numerantium 121, 243-253 (1996). MSC: 05C38 PDFBibTeX XMLCite \textit{Y. Debose} et al., Congr. Numerantium 121, 243--253 (1996; Zbl 0896.05037)
Erdős, Paul; Nesetril, Jaroslav; Rödl, Vojtech A remark on Pisier type theorems. (English) Zbl 0974.05059 Congr. Numerantium 113, 101-109 (1996). MSC: 05C65 05C15 PDFBibTeX XMLCite \textit{P. Erdős} et al., Congr. Numerantium 113, 101--109 (1996; Zbl 0974.05059)
Erdős, Paul On some problems in combinatorial set theory. (English) Zbl 0862.04003 Publ. Inst. Math., Nouv. Sér. 57(71), 61-65 (1995). Reviewer: P.Komjáth (Budapest) MSC: 03E05 00A07 05C99 03-02 PDFBibTeX XMLCite \textit{P. Erdős}, Publ. Inst. Math., Nouv. Sér. 57(71), 61--65 (1995; Zbl 0862.04003) Full Text: EuDML EMIS
Erdős, Paul Some of my favourite problems in number theory, combinatorics, and geometry. (English) Zbl 0871.11002 Resen. Inst. Mat. Estat. Univ. São Paulo 2, No. 2, 165-186 (1995). Reviewer: O.Ninnemann (Berlin) MSC: 11-02 05-02 52-02 00A07 PDFBibTeX XMLCite \textit{P. Erdős}, Resen. Inst. Mat. Estat. Univ. São Paulo 2, No. 2, 165--186 (1995; Zbl 0871.11002)
Spencer, Joel; Erdős, Paul A problem in covering progressions. (English) Zbl 0862.11007 Stud. Sci. Math. Hung. 30, No. 1-2, 149-154 (1995). Reviewer: Š.Porubský (Praha) MSC: 11B05 11B25 05A16 05D99 PDFBibTeX XMLCite \textit{J. Spencer} and \textit{P. Erdős}, Stud. Sci. Math. Hung. 30, No. 1--2, 149--154 (1995; Zbl 0862.11007)
Erdős, Paul; Füredi, Zoltán; Loebl, Martin; Sós, Vera T. Discrepancy of trees. (English) Zbl 0849.05021 Stud. Sci. Math. Hung. 30, No. 1-2, 47-57 (1995). Reviewer: K.Engel (Rostock) MSC: 05C05 05C55 05D10 05C35 PDFBibTeX XMLCite \textit{P. Erdős} et al., Stud. Sci. Math. Hung. 30, No. 1--2, 47--57 (1995; Zbl 0849.05021)
Erdős, Paul; Faudree, Ralph J.; Győri, E. On the book size of graphs with large minimum degree. (English) Zbl 0849.05038 Stud. Sci. Math. Hung. 30, No. 1-2, 25-46 (1995). Reviewer: V.Tonchev (Houghton) MSC: 05C35 05C55 PDFBibTeX XMLCite \textit{P. Erdős} et al., Stud. Sci. Math. Hung. 30, No. 1--2, 25--46 (1995; Zbl 0849.05038)
Erdős, Paul; Sós, V. T.; Faudree, Ralph J. The \(k\)-spectrum of a graph. (English) Zbl 0843.05056 Alavi, Y. (ed.) et al., Graph theory, combinatorics, algorithms and applications. Vol. 1. Proceedings of the seventh quadrennial international conference on the theory and applications of graphs, Kalamazoo, MI, USA, June 1-5, 1992. New York, NY: Wiley, 377-389 (1995). MSC: 05C35 05C05 PDFBibTeX XMLCite \textit{P. Erdős} et al., in: Graph theory, combinatorics, algorithms and applications. Vol. 1. Proceedings of the seventh quadrennial international conference on the theory and applications of graphs, Kalamazoo, MI, USA, June 1-5, 1992. New York, NY: Wiley. 377--389 (1995; Zbl 0843.05056)
Erdős, Paul Some of my recent problems in combinatorial number theory, geometry and combinatorics. (English) Zbl 0849.11024 Alavi, Y. (ed.) et al., Graph theory, combinatorics, algorithms and applications. Vol. 1. Proceedings of the seventh quadrennial international conference on the theory and applications of graphs, Kalamazoo, MI, USA, June 1-5, 1992. New York, NY: Wiley, 335-349 (1995). Reviewer: N.Hegyvari (Budapest) MSC: 11B75 52C10 00A07 05C99 05-02 11-02 52-02 05A99 PDFBibTeX XMLCite \textit{P. Erdős}, in: Graph theory, combinatorics, algorithms and applications. Vol. 1. Proceedings of the seventh quadrennial international conference on the theory and applications of graphs, Kalamazoo, MI, USA, June 1-5, 1992. New York, NY: Wiley. 335--349 (1995; Zbl 0849.11024)
Bollobás, Béla; Erdős, Paul; Jin, Guoping Strictly ascending pairs and waves. (English) Zbl 0844.05012 Alavi, Y. (ed.) et al., Graph theory, combinatorics, algorithms and applications. Vol. 1. Proceedings of the seventh quadrennial international conference on the theory and applications of graphs, Kalamazoo, MI, USA, June 1-5, 1992. New York, NY: Wiley, 83-95 (1995). Reviewer: R.Stanton (Winnipeg) MSC: 05A99 68R15 PDFBibTeX XMLCite \textit{B. Bollobás} et al., in: Graph theory, combinatorics, algorithms and applications. Vol. 1. Proceedings of the seventh quadrennial international conference on the theory and applications of graphs, Kalamazoo, MI, USA, June 1-5, 1992. New York, NY: Wiley. 83--95 (1995; Zbl 0844.05012)
Erdős, Paul; Tuza, Zsolt Vertex coverings of the edge set in a connected graph. (English) Zbl 0842.05046 Alavi, Y. (ed.) et al., Graph theory, combinatorics, algorithms and applications. Vol. 2. Proceedings of the seventh quadrennial international conference on the theory and applications of graphs, Kalamazoo, MI, USA, June 1-5, 1992. New York, NY: Wiley, 1179-1187 (1995). MSC: 05C35 05C65 05C70 PDFBibTeX XMLCite \textit{P. Erdős} and \textit{Z. Tuza}, in: Graph theory, combinatorics, algorithms and applications. Vol. 2. Proceedings of the seventh quadrennial international conference on the theory and applications of graphs, Kalamazoo, MI, USA, June 1-5, 1992. New York, NY: Wiley. 1179--1187 (1995; Zbl 0842.05046)
Erdős, Paul; Faudree, Ralph J.; Reid, Talmage James; Schelp, Richard; Staton, William Degree sequence and independence in \(K(4)\)-free graphs. (English) Zbl 0833.05074 Discrete Math. 141, No. 1-3, 275-290 (1995). Reviewer: R.Bodendiek (Kiel) MSC: 05C99 05C35 PDFBibTeX XMLCite \textit{P. Erdős} et al., Discrete Math. 141, No. 1--3, 275--290 (1995; Zbl 0833.05074) Full Text: DOI
Erdős, Paul; Gyárfás, András Vertex covering with monochromatic paths. (English) Zbl 0828.05040 Math. Pannonica 6, No. 1, 7-10 (1995). Reviewer: G.L.McColm (Tampa) MSC: 05C55 05C38 05C15 PDFBibTeX XMLCite \textit{P. Erdős} and \textit{A. Gyárfás}, Math. Pannonica 6, No. 1, 7--10 (1995; Zbl 0828.05040) Full Text: EuDML
Erdős, Paul; Füredi, Z.; Gould, R. J.; Gunderson, D. S. Extremal graphs for intersecting triangles. (English) Zbl 0822.05036 J. Comb. Theory, Ser. B 64, No. 1, 89-100 (1995). Reviewer: J.W.Moon (Edmonton) MSC: 05C35 05C38 PDFBibTeX XMLCite \textit{P. Erdős} et al., J. Comb. Theory, Ser. B 64, No. 1, 89--100 (1995; Zbl 0822.05036) Full Text: DOI
Erdős, Paul; Rödl, Vojtěch Coverings of \(r\)-graphs by complete \(r\)-partite subgraphs. (English) Zbl 0818.05037 Random Struct. Algorithms 6, No. 2-3, 319-322 (1995). Reviewer: P.Horák (Bratislava) MSC: 05C35 05C65 PDFBibTeX XMLCite \textit{P. Erdős} and \textit{V. Rödl}, Random Struct. Algorithms 6, No. 2--3, 319--322 (1995; Zbl 0818.05037) Full Text: DOI
Erdős, Paul; Suen, Stephen; Winkler, Peter On the size of a random maximal graph. (English) Zbl 0820.05054 Random Struct. Algorithms 6, No. 2-3, 309-318 (1995). Reviewer: A.Ruciński (Poznań) MSC: 05C80 05C55 PDFBibTeX XMLCite \textit{P. Erdős} et al., Random Struct. Algorithms 6, No. 2--3, 309--318 (1995; Zbl 0820.05054) Full Text: DOI
Bialostocki, Arie; Erdős, Paul; Lefmann, Hanno Monochromatic and zero-sum sets of nondecreasing diameter. (English) Zbl 0822.05046 Discrete Math. 137, No. 1-3, 19-34 (1995). Reviewer: R.Faudree (Memphis) MSC: 05C55 PDFBibTeX XMLCite \textit{A. Bialostocki} et al., Discrete Math. 137, No. 1--3, 19--34 (1995; Zbl 0822.05046) Full Text: DOI
Erdős, Paul Problems and results on set systems and hypergraphs. (English) Zbl 0820.05057 Frankl, P. (ed.) et al., Extremal problems for finite sets. Proceedings of the conference, held in Visegrád, Hungary between June 16-21, 1991. Budapest: János Bolyai Mathematical Society, Bolyai Soc. Math. Stud. 3, 217-227 (1994). Reviewer: P.Komjáth (Budapest) MSC: 05D05 05C65 00A07 05D10 05-02 PDFBibTeX XMLCite \textit{P. Erdős}, Bolyai Soc. Math. Stud. 3, 217--227 (1994; Zbl 0820.05057)
Erdős, Paul; Sárközy, A.; Sós, V. T. On additive properties of general sequences. (English) Zbl 0818.11009 Discrete Math. 136, No. 1-3, 75-99 (1994). Reviewer: J.Zöllner (Mainz) MSC: 11B13 11B34 05B10 11B75 11B83 PDFBibTeX XMLCite \textit{P. Erdős} et al., Discrete Math. 136, No. 1--3, 75--99 (1994; Zbl 0818.11009) 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 Some problems in number theory, combinatorics and combinatorial geometry. (English) Zbl 0815.11002 Math. Pannonica 5, No. 2, 261-269 (1994). Reviewer: E.Härtter (Mainz) MSC: 11-02 00A07 11B13 05Cxx 52C10 11Pxx PDFBibTeX XMLCite \textit{P. Erdős}, Math. Pannonica 5, No. 2, 261--269 (1994; Zbl 0815.11002) Full Text: EuDML
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; Gyárfás, András; Łuczak, Tomasz Independent transversals in sparse partite hypergraphs. (English) Zbl 0811.05068 Comb. Probab. Comput. 3, No. 3, 293-296 (1994). Reviewer: M.Truszczyński (Lexington) MSC: 05D15 05C65 PDFBibTeX XMLCite \textit{P. Erdős} et al., Comb. Probab. Comput. 3, No. 3, 293--296 (1994; Zbl 0811.05068) Full Text: DOI
Bertram, E.; Erdős, Paul; Horák, P.; Širáň, J.; Tuza, Zs. Local and global average degree in graphs and multigraphs. (English) Zbl 0812.05032 J. Graph Theory 18, No. 7, 647-661 (1994). Reviewer: Z.Chen (Indianapolis) MSC: 05C35 PDFBibTeX XMLCite \textit{E. Bertram} et al., J. Graph Theory 18, No. 7, 647--661 (1994; Zbl 0812.05032) Full Text: DOI
Erdős, Paul; Holzman, Ron On maximal triangle-free graphs. (English) Zbl 0807.05040 J. Graph Theory 18, No. 6, 585-594 (1994). Reviewer: E.Ederle (München) MSC: 05C35 05C65 90C05 PDFBibTeX XMLCite \textit{P. Erdős} and \textit{R. Holzman}, J. Graph Theory 18, No. 6, 585--594 (1994; Zbl 0807.05040) Full Text: DOI
Erdős, Paul; Faudree, Ralph J.; Rousseau, C. C.; Schelp, R. H. A local density condition for triangles. (English) Zbl 0796.05050 Discrete Math. 127, No. 1-3, 153-161 (1994). Reviewer: S.Stahl (Lawrence) MSC: 05C35 PDFBibTeX XMLCite \textit{P. Erdős} et al., Discrete Math. 127, No. 1--3, 153--161 (1994; Zbl 0796.05050) Full Text: DOI
Erdős, Paul; Faudree, Ralph J.; Rousseau, Cecil C. Extremal problems and generalized degrees. (English) Zbl 0796.05049 Discrete Math. 127, No. 1-3, 139-152 (1994). Reviewer: S.Stahl (Lawrence) MSC: 05C35 05C45 05C38 PDFBibTeX XMLCite \textit{P. Erdős} et al., Discrete Math. 127, No. 1--3, 139--152 (1994; Zbl 0796.05049) Full Text: DOI
Erdős, Paul; Łuczak, Tomasz Changes of leadership in a random graph process. (English) Zbl 0792.60009 Random Struct. Algorithms 5, No. 1, 243-252 (1994). MSC: 60C05 05C80 PDFBibTeX XMLCite \textit{P. Erdős} and \textit{T. Łuczak}, Random Struct. Algorithms 5, No. 1, 243--252 (1994; Zbl 0792.60009) Full Text: DOI
Erdős, Paul; Henning, Michael A.; Swart, Henda C. The smallest order of a graph with domination number equal to two and with every vertex contained in a \(K_n\). (English) Zbl 0840.05035 Ars Comb. 35A, 217-223 (1993). MSC: 05C35 PDFBibTeX XMLCite \textit{P. Erdős} et al., Ars Comb. 35 A, 217--223 (1993; Zbl 0840.05035)
Erdős, Paul; Ordman, Edward T.; Zalcstein, Yechezkel Clique partitions of chordal graphs. (English) Zbl 0793.05081 Comb. Probab. Comput. 2, No. 4, 409-415 (1993). MSC: 05C35 05C70 PDFBibTeX XMLCite \textit{P. Erdős} et al., Comb. Probab. Comput. 2, No. 4, 409--415 (1993; Zbl 0793.05081) Full Text: DOI
Erdős, Paul; Faudree, Ralph J.; Rousseau, C. C.; Schelp, R. H. Ramsey size linear graphs. (English) Zbl 0794.05085 Comb. Probab. Comput. 2, No. 4, 389-399 (1993). MSC: 05C55 05C35 PDFBibTeX XMLCite \textit{P. Erdős} et al., Comb. Probab. Comput. 2, No. 4, 389--399 (1993; Zbl 0794.05085) 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; Hattingh, Johannes H. Asymptotic bounds for irredundant Ramsey numbers. (English) Zbl 0794.05086 Quaest. Math. 16, No. 3, 319-331 (1993). Reviewer: J.E.Graver (Syracuse) MSC: 05C55 PDFBibTeX XMLCite \textit{P. Erdős} and \textit{J. H. Hattingh}, Quaest. Math. 16, No. 3, 319--331 (1993; Zbl 0794.05086) Full Text: DOI
Bollobás, Béla; Erdős, Paul; Jin, Guoping Ramsey problems in additive number theory. (English) Zbl 0789.11007 Acta Arith. 64, No. 4, 341-355 (1993). Reviewer: B.Volkmann (Stuttgart) MSC: 11B13 05D05 PDFBibTeX XMLCite \textit{B. Bollobás} et al., Acta Arith. 64, No. 4, 341--355 (1993; Zbl 0789.11007) Full Text: DOI
Erdős, Paul; Gimbel, John Some problems and results in cochromatic theory. (English) Zbl 0791.05038 Gimbel, John (ed.) et al., Quo vadis, graph theory? A source book for challenges and directions. Amsterdam: North-Holland, Ann. Discrete Math. 55, 261-264 (1993). Reviewer: L.Lesniak Foster (Madison) MSC: 05C15 00A07 PDFBibTeX XMLCite \textit{P. Erdős} and \textit{J. Gimbel}, Ann. Discrete Math. 55, 261--264 (1993; Zbl 0791.05038)
Erdős, Paul; Tuza, Zsolt Rainbow subgraphs in edge-colorings of complete graphs. (English) Zbl 0791.05037 Gimbel, John (ed.) et al., Quo vadis, graph theory? A source book for challenges and directions. Amsterdam: North-Holland, Ann. Discrete Math. 55, 81-88 (1993). MSC: 05C15 PDFBibTeX XMLCite \textit{P. Erdős} and \textit{Z. Tuza}, Ann. Discrete Math. 55, 81--88 (1993; Zbl 0791.05037)
Clark, Lane; Entringer, Roger C.; Erdős, Paul; Sun, Huicheng; Székely, László Extremal problems for the Bondy-Chvátal closure of a graph. (English) Zbl 0797.05056 Rees, Rolf S. (ed.), Graphs, matrices, and designs. Festschrift in honor of Norman J. Pullman. New York: Marcel Dekker, Inc. Lect. Notes Pure Appl. Math. 139, 73-83 (1993). Reviewer: B.Andrásfai (Budapest) MSC: 05C35 PDFBibTeX XMLCite \textit{L. Clark} et al., Lect. Notes Pure Appl. Math. 139, 73--83 (1993; Zbl 0797.05056)
Erdős, Paul; Chen, Guantao; Rousseau, C. C.; Schelp, R. H. Ramsey problems involving degrees in edge-colored complete graphs of vertices belonging to monochromatic subgraphs. (English) Zbl 0785.05067 Eur. J. Comb. 14, No. 3, 183-189 (1993). Reviewer: G.L.McColm (Tampa) MSC: 05C55 05C15 PDFBibTeX XMLCite \textit{P. Erdős} et al., Eur. J. Comb. 14, No. 3, 183--189 (1993; Zbl 0785.05067) Full Text: DOI
Erdős, Paul; Richmond, L. B. On graphical partitions. (English) Zbl 0790.05008 Combinatorica 13, No. 1, 57-63 (1993). Reviewer: D.M.Bressoud (University Park) MSC: 05A17 11B83 05C99 PDFBibTeX XMLCite \textit{P. Erdős} and \textit{L. B. Richmond}, Combinatorica 13, No. 1, 57--63 (1993; Zbl 0790.05008) 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
Bollobás, Béla; Erdős, Paul; Spencer, Joel; West, Douglas B. Clique coverings of the edges of a random graph. (English) Zbl 0782.05072 Combinatorica 13, No. 1, 1-5 (1993). Reviewer: M.Truszczyński (Lexington) MSC: 05C80 05C70 PDFBibTeX XMLCite \textit{B. Bollobás} et al., Combinatorica 13, No. 1, 1--5 (1993; Zbl 0782.05072) Full Text: DOI