Sang-ilOum

Name: Stephan Kreutzer, Disjoint Paths in Graphs and Digraphs
Start: 2026-07-28T16:30:00+09:00
End: 2026-07-28T17:30:00+09:00
Location: Room B332

S	M	T	W	T	F	S
			0 events 1 0 events, 1	0 events 2 0 events, 2	0 events 3 0 events, 3	0 events 4 0 events, 4
0 events 5 0 events, 5	0 events 6 0 events, 6	0 events 7 0 events, 7	0 events 8 0 events, 8	0 events 9 0 events, 9	0 events 10 0 events, 10	0 events 11 0 events, 11
0 events 12 0 events, 12	0 events 13 0 events, 13	0 events 14 0 events, 14	0 events 15 0 events, 15	1 event 16 1 event, 16 4:30 PM - 5:30 PM Sang-il Oum (엄상일), A proof of the cycle double cover conjecture by OpenAI July 16 Thursday @ 4:30 PM - 5:30 PM KST Sang-il Oum (엄상일), A proof of the cycle double cover conjecture by OpenAI The cycle double cover conjecture (CDC) claims that every graph without cut-edges has a list of cycles such that every edge appears exactly twice in the list. This conjecture was proposed in 1970s by several mathematicians independently, including Tutte, Seymour, and Szekeres. On July 10, 2026, OpenAI released a proof found by its ChatGPT 5.6 … Continue Reading	0 events 17 0 events, 17	0 events 18 0 events, 18
0 events 19 0 events, 19	0 events 20 0 events, 20	0 events 21 0 events, 21	0 events 22 0 events, 22	0 events 23 0 events, 23	0 events 24 0 events, 24	0 events 25 0 events, 25
0 events 26 0 events, 26	0 events 27 0 events, 27	0 events 28 0 events, 28	0 events 29 0 events, 29	0 events 30 0 events, 30	0 events 31 0 events, 31

There are no events on this day.

July 16 Thursday

July 16 Thursday @ 4:30 PM - 5:30 PM KST

Sang-il Oum (엄상일), A proof of the cycle double cover conjecture by OpenAI

There are no events on this day.

DIMAG on YouTube

We use YouTube Live to broadcast seminar talks live if the speaker agrees.

Calendar of Events

1 event 16

1 event, 16

Sang-il Oum (엄상일), A proof of the cycle double cover conjecture by OpenAI