Unsolved Problems in Graph Theory

  Рет қаралды 7,012

ThoughtThrill

ThoughtThrill

Күн бұрын

Пікірлер: 16
@lyrimetacurl0
@lyrimetacurl0 2 күн бұрын
"look at this graph"
@natepolidoro4565
@natepolidoro4565 2 күн бұрын
Great quality video. I love this channel.
@marcelob.5300
@marcelob.5300 2 күн бұрын
Absolutely, they deserve 1M subscribers
@Busybody007
@Busybody007 2 күн бұрын
amazing animation soo easy to understand.
@Fepo.productions
@Fepo.productions 2 күн бұрын
Me, who is supposed to revise GCSE level maths for my mocks Random video explaining a maths concept I didn't even think could be thought up in fiction Me: hmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmm
@ThoughtThrill365
@ThoughtThrill365 2 күн бұрын
They are unsolved for a reason 😄
@davethesid8960
@davethesid8960 13 сағат бұрын
0:18 - That's why in Hungarian we say "gráf" and "grafikon" to distinguish them.
@patrickgambill9326
@patrickgambill9326 2 күн бұрын
These are great! Do you like the switching reconstruction and vertex reconstruction problems?
@marcelob.5300
@marcelob.5300 2 күн бұрын
Great content!
@patrickgambill9326
@patrickgambill9326 2 күн бұрын
9:58 What about the graph with no edges? Aren't the chromatic and total chromatic number the same?
@nivpearlman6514
@nivpearlman6514 2 күн бұрын
Delta(G)=0 X(G)=X''(G)=1 They are the same but trivially and equal to one
@patrickgambill9326
@patrickgambill9326 Күн бұрын
Makes sense. I definitely misheard the video. They said maximum degree, not ordinary chromatic number 😅
@isavenewspapers8890
@isavenewspapers8890 Күн бұрын
This is an interesting edge case (no pun intended). For any edgeless graph, the chromatic number and the total chromatic number are either both 0 or both 1 (and hence the same number). The former arises only in the case of the unique graph with no vertices-the order-zero graph. After all, the graph vacuously starts out with every vertex and edge colored, so we don't need to pick up a single crayon. What about the maximum degree of this graph? Finding a graph's maximum degree amounts to finding the maximum of the set of the degrees of its vertices. But if you take the set of the degrees of the vertices of the order-zero graph, you just get the empty set. You can't take the maximum of the empty set, so the maximum degree of the order-zero graph is undefined. ... At least, I think that's how it works. For a more airtight answer, I'd probably need to be more careful about some of the formal definitions.
@Dravignor
@Dravignor Күн бұрын
Where's the graph isomorphism problem?
@omfgacceptmyname
@omfgacceptmyname Күн бұрын
divine ambitions? really weird way to say that 5:15 this whole section was strange
@oserodal2702
@oserodal2702 Күн бұрын
A category is just a funny graph with a few rules. Why not do unsolved problems for category theory?
Every Unsolved Geometry Problem that Sounds Easy
11:37
ThoughtThrill
Рет қаралды 485 М.
You're Probably Wrong About Rainbows
27:11
Veritasium
Рет қаралды 3,6 МЛН
Tuna 🍣 ​⁠@patrickzeinali ​⁠@ChefRush
00:48
albert_cancook
Рет қаралды 51 МЛН
I was just passing by
00:10
Artem Ivashin
Рет қаралды 18 МЛН
Every Weird Number System Explained
10:57
ThoughtThrill
Рет қаралды 11 М.
I Made an Electronic Chessboard Without Turns
14:32
From Scratch
Рет қаралды 338 М.
Leonhard euler the greatest of all
10:22
ever d!d
Рет қаралды 13 М.
Universal Construction | Category Theory and Why We Care
25:50
Eyesomorphic
Рет қаралды 7 М.
This Was an Awful Idea
8:43
Daily Dose Of Internet
Рет қаралды 2 МЛН
The Player Type Alignment Tesseract
12:34
Ellie Rasmussen
Рет қаралды 28 М.
The sequence that grows remarkably large, then drops to zero!
17:28
Math's Map Coloring Problem - The First Proof Solved By A Computer
9:04
Quanta Magazine
Рет қаралды 238 М.
Every Unsolved Circle Problem that Sounds Easy
9:50
ThoughtThrill
Рет қаралды 20 М.