Sieve methods in random graph theory

DOI10.1007/S00373-023-02635-XOpenAlexW2806119317MaRDI QIDQ2701395

Yu-Ru Liu, J. C. Saunders

Publication date: 28 April 2023

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1805.11153

zbMATH Keywords

probabilistic combinatoricssieve theoryrandom graph theoryprobabilistic calculations

Mathematics Subject Classification ID

Multiplicative number theory (11Nxx) Graph theory (05Cxx) Enumerative combinatorics (05Axx)

Cites Work

• Unnamed Item
• The combinatorics behind number-theoretic sieves
• The shifted Turán sieve method on tournaments. II
• Sieve methods in combinatorics
• The Diameter of Random Graphs
• On a Theorem of Hardy and Ramanujan
• The Shifted Turán Sieve Method on Tournaments
• Random Graphs

This page was built for publication: Sieve methods in random graph theory