Acan, Hüseyin; Frieze, Alan; Pittel, Boris Giant descendant trees, matchings, and independent sets in age-biased attachment graphs. (English) Zbl 1492.05141 J. Appl. Probab. 59, No. 2, 299-324 (2022). Reviewer: David B. Penman (Colchester) MSC: 05C80 05C05 60C05 05C30 PDFBibTeX XMLCite \textit{H. Acan} et al., J. Appl. Probab. 59, No. 2, 299--324 (2022; Zbl 1492.05141) Full Text: DOI arXiv
Frieze, Alan; Pittel, Boris On a sparse random graph with minimum degree three: likely Pósa sets are large. (English) Zbl 1275.05051 J. Comb. 4, No. 2, 123-156 (2013). MSC: 05C80 05C35 05C38 05C42 34E05 60C05 PDFBibTeX XMLCite \textit{A. Frieze} and \textit{B. Pittel}, J. Comb. 4, No. 2, 123--156 (2013; Zbl 1275.05051) Full Text: DOI arXiv Link
Frieze, Alan; Pittel, Boris Perfect matchings in random graphs with prescribed minimal degree. (English) Zbl 1055.05135 Drmota, Michael (ed.) et al., Mathematics and computer science III. Algorithms, trees, combinatorics and probabilities. Proceedings of the international colloquium of mathematics and computer sciences, Vienna, September 13–17, 2004. Basel: Birkhäuser (ISBN 3-7643-7128-5/hbk). Trends in Mathematics, 95-132 (2004). Reviewer: David B. Penman (Colchester) MSC: 05C80 05C70 PDFBibTeX XMLCite \textit{A. Frieze} and \textit{B. Pittel}, in: Mathematics and computer science III. Algorithms, trees, combinatorics and probabilities. Proceedings of the international colloquium of mathematics and computer sciences, Vienna, September 13--17, 2004. Basel: Birkhäuser. 95--132 (2004; Zbl 1055.05135)
Frieze, Alan; Pittel, Boris Perfect matchings in random graphs with prescribed minimal degree. (Extended abstract). (English) Zbl 1095.68621 Proceedings of the fourteenth annual ACM-SIAM symposium on discrete algorithms, Baltimore, MD, USA, January 12–14, 2003. New York, NY: Association for Computing Machinery; Philadelphia, PA: Society for Industrial and Applied Mathematics (ISBN 0-89871-538-5/pbk). 148-157 (2003). MSC: 68R10 05C70 05C80 05C85 PDFBibTeX XMLCite \textit{A. Frieze} and \textit{B. Pittel}, in: Proceedings of the fourteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2003, Baltimore, MD, USA, January 12--14, 2003. New York, NY: Association for Computing Machinery; Philadelphia, PA: Society for Industrial and Applied Mathematics. 148--157 (2003; Zbl 1095.68621)
Aronson, Jonathan; Frieze, Alan; Pittel, Boris G. Maximum matchings in sparse random graphs: Karp-Sipser revisited. (English) Zbl 0998.05058 Random Struct. Algorithms 12, No. 2, 111-177 (1998). MSC: 05C80 05C70 05C85 68W40 PDFBibTeX XMLCite \textit{J. Aronson} et al., Random Struct. Algorithms 12, No. 2, 111--177 (1998; Zbl 0998.05058)
Frieze, Alan; Pittel, Boris G. Probabilistic analysis of an algorithm in the theory of markets in indivisible goods. (English) Zbl 0843.90031 Ann. Appl. Probab. 5, No. 3, 768-808 (1995). MSC: 91B26 60J10 PDFBibTeX XMLCite \textit{A. Frieze} and \textit{B. G. Pittel}, Ann. Appl. Probab. 5, No. 3, 768--808 (1995; Zbl 0843.90031) Full Text: DOI
Dyer, Martin; Frieze, Alan; Pittel, Boris The average performance of the greedy matching algorithm. (English) Zbl 0779.60009 Ann. Appl. Probab. 3, No. 2, 526-552 (1993). MSC: 60C05 60F05 05C80 05C70 PDFBibTeX XMLCite \textit{M. Dyer} et al., Ann. Appl. Probab. 3, No. 2, 526--552 (1993; Zbl 0779.60009) Full Text: DOI