Erdős's f(n) equals c2 n + o(n) and q(n) equals β2^{n+o(n)} for computable constants c2 and β2, via a general theorem on forbidden connected subgraphs in divisor graphs.
Vijay , title =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Forbidden subgraphs in divisor graphs and an Erd\H{o}s divisibility problem
Erdős's f(n) equals c2 n + o(n) and q(n) equals β2^{n+o(n)} for computable constants c2 and β2, via a general theorem on forbidden connected subgraphs in divisor graphs.