<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>On the genus of the complete tripartite graph $K_{n,n,1}$ · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1612.07888/</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/1612.07888/feed.xml" rel="self" type="application/rss+xml" /><item><title>On the genus of the complete tripartite graph $K_{n,n,1}$ — mentioned by no_identd</title><link>https://news.ycombinator.com/item?id=17185025</link><guid isPermaLink="false">urn:hackerpapers:mention:1612.07888:17185025</guid><pubDate>Wed, 30 May 2018 04:14:59 GMT</pubDate><description>&lt;p&gt;Here, two very much related papers, albeit the title of the first one wouldn&amp;#x27;t tell you that: https://arxiv.org/abs/1612.07888 Kurauskas, Valentas - On the genus of the complete tripartite graph Kn,n,1 [2017] https://arxiv.org/abs/1801.03860 Kurauskas, Valentas; Šiurienė, Ugnė - Symmetric road interchanges [2018] And slides from 2010: http://web.archive.org/web/20101127223543/http://www.saga-ne...&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1612.07888/"&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>
