Thue Games - A Faculties at Google Talk (Krakow 2009)
3,822 views · Published 9 March 2009 · 51:01 · Indexed 24 October 2026
Channel: Google TechTalks · 2009 · Science & Technology
Thue games can be played on various combinatorial structures: graphs, hypergraphs, words, Euclidean spaces, etc. Basic idea goes back to Thue, who proved that the integers can be 3-colored so that adjacent intervals have different color patterns. This striking result has been generalized in many directions, leading to a variety of peculiar coloring problems with unexpected connections to other topics, like the necklace splitting problem, or graph colorings by edge weightings. The talk presents these connections, some recent results, and several open problems in the area. Presented by Jaroslaw Grytczuk
More from this channel
-
34:17
Thinglink - A Free Product Code for Creative Work
-
32:48
Thinking Beyond Borders
-
44:29
Understanding Urban Environments Through the Use of...
-
46:05
Customer Centric Web Decision Making
-
46:04
Customizable Scalable Compute Intensive Stream Queries
-
51:26
All The Government's Information
-
41:35
Combining Discriminative Features to Infer Complex...
-
59:42
Dimensions of Reputation in Electronic Markets