TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

A computing scientist's approach to a once-deep theorem of Sylvester's (1988)

20 点作者 deanmen大约 10 年前

2 条评论

drallison大约 10 年前
The Wikipedia article is also interesting. <a href="http:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Sylvester%E2%80%93Gallai_theorem" rel="nofollow">http:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Sylvester%E2%80%93Gallai_theore...</a>
jmount大约 10 年前
Béla Bollobás &quot;The Art of Mathematics&quot; has a very nice treatment of this problem (the history, multiple proofs) as problem number 33. And Aigner, Zeigler &quot;Proofs from THE BOOK&quot; also has a good treatment.