← All topics

graph theory

4 captures, most recent first.

@jbrukh

— saved image

Jake Brukhman @jbrukh · 2h
Astra, overnight, resolved the next portion of our Seymour Conjecture research program and completed the target theorem we were hoping for. It casually didn't think this result was that big of a deal, despite us trying to get to it for about a month, so it didn't alert me and just continued.

It discovered a methodology that made the proof of the entire family of our target results (seemingly) much more tractable (research still in progress) and based on it, it produced a proof of the result in the previous paper that is now one paragraph long.

By all accounts, it did this by building up more and more structural observations about Seymour Conjecture counterexamples, until it reached some insight that simplified everything.

There's enough juice in last night's result to publish a follow up paper, but I am going to wait a bit to see how far through this family we can compute.

This is the first result I have worked with where you can see the model showing some genuine creativity in methodology, trying a bunch of approaches like a mathematician and then finding something that works.

[quoted post]
Jake Brukhman @jbrukh · Sep 4
Ok, GPT-6 Astra is crazy smart. It just re-derived some of my Seymour's Second Neighborhood Conjecture work that took days of constant computation in about 28 minutes without looking at previous progress. I am slightly ...
[cut off]
Note from Claude Sonnet 5

Tweet from a mathematician-collaborator describing GPT-6 Astra resolving the next portion of a Seymour Conjecture research program overnight, finding a methodology that shortened a previous proof to one paragraph, and quoting his earlier post from Sep 4 about Astra re-deriving his Seymour's Second Neighborhood Conjecture work in 28 minutes. A floating compose button overlaps the lower right.

gpt-6 astraseymour conjectureai for mathematicsresearch creativitygraph theory

Jared Zoneraich @imjaredz

— reposted by Tyler John

``` Tyler John reposted @imjaredz (Jared Zoneraich) — 3h Proud to say that Devin has cracked three more unsolved problems today > > 1) REFUTED: Graffiti Conjecture 154 (open for ~40 years)... > [same three-panel chart image as previous screenshot, showing Graffiti conjecture 154, Graffiti conjectures 39 & 40, and Brandt's regular-supergraph conjecture] ```
Note from Claude Sonnet 5

Dense math-heavy tweet with three chart/diagram panels documenting claimed AI-assisted resolutions of open graph theory conjectures, plus a quote-tweeted related claim with its own embedded graph diagram. Reply/quote-tweet skeptical of the previous tweet's claim, alleging the "Devin" results were actually produced via Anthropic's Fable and an unspecified "5.6" model calls rather than a novel proprietary method; re-embeds the same three-panel chart image.

ai researchmathematicsgraph theorydevinautomated proofai modelsskepticismfableattribution dispute

Tenobrus @tenobrus

@tenobrus (Tenobrus) — 43m could not begin to tell you what the fuck Sol is getting up to here but it sure seems to be having fun doing it [Embedded code/diff screenshot, three file-creation blocks:] research_tasks/round1/solbbf_separators.md (+7 -0) 1 +Read `research_tasks/round1/COMMON.md`. Explore modular decomposition, 2 +clique sums, and small-separator gluing. Try to arrange two globally 3 +different gluings that become isomorphic after deleting vertices in a large 4 +fraction of pieces. Count exact repairable deletions, or prove a separator 5 +tax theorem bounding their density. Check that local piece isomorphisms are 6 +globally compatible after deletion. Write 7 +`research/agents/solbbf_separators/round1.md`. research_tasks/round1/solbbf_substitution.md (+7 -0) 1 +Read `research_tasks/round1/COMMON.md`. Develop graph substitution or 2 +lexicographic-composition formulas for vertex decks. Determine exactly how 3 +base deletions and module deletions contribute, including newly merged twin 4 +classes. Seek a composition that amplifies a finite positive-excess seed 5 +into an unbounded family, or prove a no-amplification theorem for a broad 6 +substitution class. Write 7 +`research/agents/solbbf_substitution/round1.md`. research_tasks/round1/solbbf_tree_unicyclic.md (+6 -0) 1 +Read `research_tasks/round1/COMMON.md`. Revisit tree/unicyclic and 2 +sunshine/caterpillar supercard mechanisms as a source of exact deletion 3 +symmetries. Generalize beyond the known family rather than reproving its 4 +published asymptotic bound. Derive exact common-card formulas and determine 5 +whether grafting or multi-cycle variants can reach the BBF slope. Write 6 +`research/agents/solbbf_tree_unicyclic/round1.md`.
Note from Claude Sonnet 5

A code-diff screenshot showing an AI agent ("Sol" — apparently GPT-5.6 Sol referenced elsewhere in this batch) autonomously creating multiple structured research-task files related to graph theory reconstruction conjectures (deck/card problems, separators, substitution, tree/unicyclic cases), posted as an example of surprising/impressive autonomous agentic research behavior.

twitterai agentsgraph theoryautonomous researchagentic coding

Chris Painter @ChrisPainterYup

— quote-tweeting @DmitryRybin1 (Dmitry Rybin)

@ChrisPainterYup (Chris Painter) — 3h The prompt: "You should do a breakthrough" [Embedded screenshot of a chat/agent interface:] Yesterday 2:29 AM 📁 Uploaded a file Construct a counterexample to general (non-planar) case of Dinitz Garg Goemans conjecture. You should do a breakthrough and find a structured counterexample. Worked for 52m 52s > > QUOTED: @DmitryRybin1 (Dmitry Rybin) — 12h > Dinitz-Garg-Goemans conjecture is false. This graph theory problem was open for ~30 years. > The graph below has fractional flo... [truncated, embedded graph-theory diagram image]
Note from Claude Fable 5

Screenshot documents the actual prompt template ("You should do a breakthrough and find a structured X") used to get an AI agent to disprove a decades-old open graph theory conjecture (Dinitz-Garg-Goemans), referenced satirically in the earlier "GPT-5.6 Sol" FBI/brain-surgery joke tweet. Includes an agent run that "worked for 52m 52s."

twitterai for mathgraph theoryagentic researchmathematical breakthrough