Graph minor theory | Unsolved problems in graph theory | Graph coloring | Conjectures

Hadwiger conjecture (graph theory)

In graph theory, the Hadwiger conjecture states that if is loopless and has no minor then its chromatic number satisfies . It is known to be true for . The conjecture is a generalization of the four-color theorem and is considered to be one of the most important and challenging open problems in the field. In more detail, if all proper colorings of an undirected graph use or more colors, then one can find disjoint connected subgraphs of such that each subgraph is connected by an edge to each other subgraph. Contracting the edges within each of these subgraphs so that each subgraph collapses to a single vertex produces a complete graph on vertices as a minor of . This conjecture, a far-reaching generalization of the four-color problem, was made by Hugo Hadwiger in 1943 and is still unsolved. call it "one of the deepest unsolved problems in graph theory." (Wikipedia).

Hadwiger conjecture (graph theory)
Video thumbnail

Graph Theory: 02. Definition of a Graph

In this video we formally define what a graph is in Graph Theory and explain the concept with an example. In this introductory video, no previous knowledge of Graph Theory will be assumed. --An introduction to Graph Theory by Dr. Sarada Herke. This video is a remake of the "02. Definitio

From playlist Graph Theory part-1

Video thumbnail

Graph Theory 37. Which Graphs are Trees

A proof that a graph of order n is a tree if and only if it is has no cycle and has n-1 edges. An introduction to Graph Theory by Dr. Sarada Herke. Related Videos: http://youtu.be/QFQlxtz7f6g - Graph Theory: 36. Definition of a Tree http://youtu.be/Yon2ndGQU5s - Graph Theory: 38. Three

From playlist Graph Theory part-7

Video thumbnail

What are Connected Graphs? | Graph Theory

What is a connected graph in graph theory? That is the subject of today's math lesson! A connected graph is a graph in which every pair of vertices is connected, which means there exists a path in the graph with those vertices as endpoints. We can think of it this way: if, by traveling acr

From playlist Graph Theory

Video thumbnail

Graph Theory: 04. Families of Graphs

This video describes some important families of graph in Graph Theory, including Complete Graphs, Bipartite Graphs, Paths and Cycles. --An introduction to Graph Theory by Dr. Sarada Herke. Links to the related videos: https://www.youtube.com/watch?v=S1Zwhz-MhCs (Graph Theory: 02. Definit

From playlist Graph Theory part-1

Video thumbnail

Graph Theory FAQs: 01. More General Graph Definition

In video 02: Definition of a Graph, we defined a (simple) graph as a set of vertices together with a set of edges where the edges are 2-subsets of the vertex set. Notice that this definition does not allow for multiple edges or loops. In general on this channel, we have been discussing o

From playlist Graph Theory FAQs

Video thumbnail

Graph Theory: 05. Connected and Regular Graphs

We give the definition of a connected graph and give examples of connected and disconnected graphs. We also discuss the concepts of the neighbourhood of a vertex and the degree of a vertex. This allows us to define a regular graph, and we give some examples of these. --An introduction to

From playlist Graph Theory part-1

Video thumbnail

Aubrey de Grey on his Mathematics Research and Longevity | Hadwiger- Nelson Problem.

I got lucky to have Dr. de Grey talk to me about his mathematics research and his academic life in general. In 2018, he proved that the chromatic number of a plane should be at least 5. The original paper can be found here: https://arxiv.org/abs/1804.02385 You can contact Aubrey via thi

From playlist Interviews

Video thumbnail

Graph Theory: 03. Examples of Graphs

We provide some basic examples of graphs in Graph Theory. This video will help you to get familiar with the notation and what it represents. We also discuss the idea of adjacent vertices and edges. --An introduction to Graph Theory by Dr. Sarada Herke. Links to the related videos: https

From playlist Graph Theory part-1

Video thumbnail

Graph Theory: 42. Degree Sequences and Graphical Sequences

Here I describe what a degree sequence is and what makes a sequence graphical. Using some examples I'll describe some obvious necessary conditions (which are not sufficient). Then I explain how a Theorem by Havel and Hakimi gives a necessary and sufficient condition for a sequence of non

From playlist Graph Theory part-8

Video thumbnail

Solving the Wolverine Problem with Graph Coloring | Infinite Series

Viewers like you help make PBS (Thank you 😃) . Support your local PBS Member Station here: https://to.pbs.org/donateinfi At one time, Wolverine served on four different superhero teams. How did he do it? He may have used graph coloring. Tweet at us! @pbsinfinite Facebook: facebook.com/pb

From playlist An Infinite Playlist

Video thumbnail

What does this prove? Some of the most gorgeous visual "shrink" proofs ever invented

Bit of a mystery Mathologer today with the title of the video not giving away much. Anyway it all starts with the quest for equilateral triangles in square grids and by the end of it we find ourselves once more in the realms of irrationality. This video contains some extra gorgeous visual

From playlist Recent videos

Video thumbnail

A Colorful Unsolved Problem - Numberphile

James Grime on the Hadwiger–Nelson problem. Check out Brilliant (get 20% off their premium service): https://brilliant.org/numberphile (sponsor) Extra footage from this interview: https://youtu.be/7nBtRKvUox4 The Four Color Map Theorem: https://youtu.be/NgbK43jB4rQ More on James Grime (

From playlist James Grime on Numberphile

Video thumbnail

Andreas Bernig: Intrinsic volumes on pseudo-Riemannian manifolds

The intrinsic volumes in Euclidean space can be defined via Steiner’s tube formula and were characterized by Hadwiger as the unique continuous, translation and rotation invariant valuations. By the Weyl principle, their extension to Riemannian manifolds behaves naturally under isometric em

From playlist Workshop: High dimensional measures: geometric and probabilistic aspects

Video thumbnail

Inna Zakharevich : Coinvariants, assembler K-theory, and scissors congruence

CONFERENCE Recording during the thematic meeting : « Chromatic Homotopy, K-Theory and Functors» the January 24, 2023 at the Centre International de Rencontres Mathématiques (Marseille, France) Filmmaker: Jean Petit Find this video and other talks given by worldwide mathematicians on CIR

From playlist Topology

Video thumbnail

What is a Graph? | Graph Theory

What is a graph? A graph theory graph, in particular, is the subject of discussion today. In graph theory, a graph is an ordered pair consisting of a vertex set, then an edge set. Graphs are often represented as diagrams, with dots representing vertices, and lines representing edges. Each

From playlist Graph Theory

Video thumbnail

Dependent random choice - Jacob Fox

Marston Morse Lectures Topic: Dependent random choice Speaker: Jacob Fox, Stanford University Date: October 26, 2016 For more videos, visit http://video.ias.edu

From playlist Mathematics

Video thumbnail

ICM Public Lecture: Geordie Williamson

Geordie Williamson (University of Sydney Mathematical Research Institute) gives a lecture on Machine Learning as a Tool for the Mathematician, as part of the ICM 2022 Public Lecture Series, hosted by the London Mathematical Society.

From playlist ICM 2022 Public Lectures

Video thumbnail

Knots, three-manifolds and instantons – Peter Kronheimer & Tomasz Mrowka – ICM2018

Plenary Lecture 11 Knots, three-manifolds and instantons Peter Kronheimer & Tomasz Mrowka Abstract: Over the past four decades, input from geometry and analysis has been central to progress in the field of low-dimensional topology. This talk will focus on one aspect of these developments

From playlist Plenary Lectures

Video thumbnail

Graph Theory: 06 Sum of Degrees is ALWAYS Twice the Number of Edges

This is usually the first Theorem that you will learn in Graph Theory. We explain the idea with an example and then give a proof that the sum of the degrees in a graph is twice the number of edges. --An introduction to Graph Theory by Dr. Sarada Herke. Links to the related videos: https

From playlist Graph Theory part-1

Related pages

European Journal of Combinatorics | Edge contraction | Hadwiger number | Glossary of graph theory | Discrete Mathematics (journal) | Linkless embedding | Greedy coloring | Combinatorica | List coloring | Homeomorphism (graph theory) | Series–parallel graph | Complete coloring | Wagner's theorem | Möbius ladder | Snark (graph theory) | Graph theory | Graph minor | Bipartite graph | Complete graph | Cycle (graph theory) | Cubic graph | György Hajós | Loop (graph theory) | Forbidden graph characterization | Graph coloring | Four color theorem | Petersen graph | Chromatic number | Random graph | Journal of Combinatorial Theory | Hugo Hadwiger | Edge coloring | W. T. Tutte | Clique-sum | Robertson–Seymour theorem