Sieve methods in random graph theory

DOI10.1007/S00373-023-02635-XMaRDI QIDQ2701395zbMATH OpenOpenAlexFDO

Authors 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 calculationsprobabilistic combinatoricsrandom graph theorysieve theory

Mathematics Subject Classification ID

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

Recommendations

• On a method for random graphs
• Sieve methods in combinatorics
• scientific article; zbMATH DE number 4101220
• scientific article; zbMATH DE number 986986
• Kolmogorov Random Graphs and the Incompressibility Method
• Introduction to random graphs (and the probabilistic method)
• Random procedures for dominating sets in graphs
• scientific article; zbMATH DE number 18981
• scientific article; zbMATH DE number 1943957

Cites work

• scientific article; zbMATH DE number 3338615 (Why is no real title available?)
• On a Theorem of Hardy and Ramanujan
• Random Graphs
• Sieve methods in combinatorics
• The combinatorics behind number-theoretic sieves
• The Diameter of Random Graphs
• The shifted Turán sieve method on tournaments
• The shifted Turán sieve method on tournaments. II

Cited in

(3)

• Sieve methods in combinatorics
• Sieve Methods in Random Graph Theory
• Diameters of random bipartite graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2701395)