Skip to content
gentic.news — AI News Intelligence Platform
Connecting to the Living Graph…
Subgraph Atlas · centered on entity

Erdős problems

research topic1 mentions· velocity: stable

Paul Erdős was a Hungarian mathematician. He was one of the most prolific mathematicians and producers of mathematical conjectures of the 20th century. Erdős pursued and proposed problems in discrete mathematics, graph theory, number theory, mathematical analysis, approximation theory, set theory, a

Two-hop subgraph: this entity, every entity it directly relates to, and every entity those neighbors relate to. Drag a node, scroll to zoom, click to inspect — or click any neighbor and re-center the atlas there.

0 nodes · 0 edges · loading…
companypersonai_modelproductresearch_labbenchmarkframework
drag to move · scroll to zoom · click a node
How to read this: the white-ringed node is Erdős problems. Surrounding nodes are direct relationships; the second ring is what those neighbors connect to. Edge thickness scales with source-article evidence. Click any node and choose Center graph here to walk the graph.