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; 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)
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
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; Gallai, Tibor; Tuza, Zsolt Covering the cliques of a graph with vertices. (English) Zbl 0766.05063 Discrete Math. 108, No. 1-3, 279-289 (1992). Reviewer: R.C.Entringer (Albuquerque) MSC: 05C70 05C35 05C85 PDFBibTeX XMLCite \textit{P. Erdős} et al., Discrete Math. 108, No. 1--3, 279--289 (1992; Zbl 0766.05063) Full Text: DOI
Erdős, Paul; Fajtlowicz, Siemion; Staton, William Degree sequences in triangle-free graphs. (English) Zbl 0752.05028 Discrete Math. 92, No. 1-3, 85-88 (1991). Reviewer: C.Chaty (Paris) MSC: 05C15 05C99 PDFBibTeX XMLCite \textit{P. Erdős} et al., Discrete Math. 92, No. 1--3, 85--88 (1991; Zbl 0752.05028) Full Text: DOI
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; 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; Purdy, G.; Straus, E. G. On a problem in combinatorial geometry. (English) Zbl 0501.52009 Discrete Math. 40, 45-52 (1982). Reviewer: D.C.Kay MSC: 52A40 PDFBibTeX XMLCite \textit{P. Erdős} et al., Discrete Math. 40, 45--52 (1982; Zbl 0501.52009) Full Text: DOI