<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Erdos-Hajnal for graphs with no 5-hole · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2102.04994/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2102.04994/feed.xml" rel="self" type="application/rss+xml" /><item><title>Erdos-Hajnal for graphs with no 5-hole — mentioned by mFixman</title><link>https://news.ycombinator.com/item?id=26944749</link><guid isPermaLink="false">urn:hackerpapers:mention:2102.04994:26944749</guid><pubDate>Mon, 26 Apr 2021 16:50:42 GMT</pubDate><description>&lt;p&gt;I&amp;#x27;m impressed by how clear the article is for a layman. I only know the very basics of graph theory and Ramsay theory and I understood the topic perfectly. This is in comparison to the paper [1] which at a glance seems terse and difficult to understand. If anyone likes Ramsay theory and these kind of articles, I recommend Erdős&amp;#x27; biography &amp;quot;The Man Who Loved Only Numbers&amp;quot;. [1] https://arxiv.org/abs/2102.04994&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2102.04994/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.CO</category></item></channel></rss>
