- Location:
- DERR 331; 331
- Cost:
- Free
- Contact:
- Jian Shen
js48@txstate.edu
- Campus Sponsor:
- Department of Mathematics
Title: AI-Assisted Proof of the Δ-Conjecture for CIS d-Graphs
Speaker: Dr. Jian Shen (Your AI Translator)
Location: Derrick Hall 331
Abstract:
Let the edges of a complete graph K_n be colored with d colors from {1,2,…,d}, and for each i let G_i be the graph on the same vertex set formed by the edges of color i. In 1978, Gurvich proposed the following conjecture:
Gurvich’s Δ-Conjecture (1978). If every choice of a maximal independent set S_i of G_i, one for each i∈{1,2,…,d}, has nonempty intersection, then the coloring contains no rainbow triangle. Here a rainbow triangle is a triangle whose edges have three different colors.
In a recent arXiv preprint (August 27, 2026), Liu and Tang presented an AI-assisted proof of this conjecture.
In this talk, I will explain the main ideas of their proof, emphasizing the intuition behind the argument. I will aim to make the presentation self-contained and accessible to faculty and graduate students from different areas of mathematics.
Questions for discussion
What does it mean to understand a proof beyond verifying its correctness?
How should we validate AI-assisted proofs and acknowledge human and AI contributions?
Where can AI contribute most effectively to mathematical research?
How should graduate training respond to AI-assisted discovery and proof formalization?