Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Chromatic Number of G-Borsuk Graphs

Applied Algebraic Topology Network via YouTube

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore the chromatic number of G-Borsuk graphs in this 50-minute lecture from the Applied Algebraic Topology Network. Delve into the definition of G-Borsuk graphs, their relationship to compact spaces with free group actions, and the connection between their chromatic number and the topology of the underlying space. Examine lower bounds using G-actions on Hom-complexes and upper bounds derived from a recursive formula on the space's dimension. Investigate the conjecture that the true chromatic number matches the lower bound, supported by computational evidence. Study random G-Borsuk graphs and the thresholds for epsilon that maintain the chromatic number of the whole graph. Analyze the tightness of results when the G-index and dimension of the space coincide, and explore the transition of chromatic numbers in various scenarios.

Syllabus

Introduction
Motivation
Natural question
Chromatic number of borsuk graphs
Theorem
Randomization
Antipodality
G vs Graph
simplicial complexes
gindex
original vs graph case
upper and lower bounds
lower bounds
uniform probability measure
Questions
Chromatic number theorem
Chromatic number transition

Taught by

Applied Algebraic Topology Network

Reviews

Start your review of Chromatic Number of G-Borsuk Graphs

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.