On a connection of two graph-theoretic problems with conjectures of Ramanujan and Samuels

DOI10.1070/RM9836zbMath1442.60012OpenAlexW2892188139WikidataQ122997864 ScholiaQ122997864MaRDI QIDQ5377092

D. I. Dmitriev, M. E. Zhukovskii

Publication date: 23 May 2019

Published in: Russian Mathematical Surveys (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1070/rm9836

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Cites Work

• Unnamed Item
• Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
• On Ramanujan's \(Q\)-function
• Threshold functions for small subgraphs
• Monotone Convergence of Binomial Probabilities and a Generalization of Ramanujan's Equation
• On a Chebyshev-Type Inequality for Sums of Independent Random Variables

This page was built for publication: On a connection of two graph-theoretic problems with conjectures of Ramanujan and Samuels