ViralLoop

Dinitz-Garg-Goemans conjecture is false. This graph theory problem was open for ~30 years. The graph below has fractional flow cost 58. Any unsplittable flow (with capacity violation <=15) has cost at least 60. Chat with GPT 5.6 Pro where this was found: t.co

10K likes263 repliesPosted Jul 22, 2026

Remix this post

Your note

Private to you, and used when you remix this post.

Viral score

Based on absolute engagement — the platform doesn’t expose follower counts here, so large accounts score higher.

From likes, comments.

Why it worked

Opens with a short, self-contained line that is easy to take in at a glance.
Follows a clear Hook → Context → Landing shape, so the reader always knows where they are.
Ends on a short line that is easy to quote and repeat.
Short enough to read in full without expanding, which removes a step before the point lands.
Short sentences keep the pace up, so the reader never has to re-read a line.

The mechanics

Hook: Plain observation
Structure: Hook → Context → Landing
Style: Conversational paragraphs at a steady pace.
Tone: punchy
Written for: People building with AI

Analysis by ViralLoop — not written by the original author.

Post by Dmitry Rybin on X