Edge Colorings and Chromatic Index of Graphs | Graph Theory
We introduce edge colorings of graphs and the edge chromatic number of graphs, also called the chromatic index. We'll talk about k-colorings/k-edge colorings, minimum edge colorings, edge colourings as matchings, edge colourings as functions, and see examples and non-examples of edge color
From playlist Graph Theory
Ramsey theory is based on Ramsey's theorem, because without it, there would be no Ramsey numbers, since they are not well-defined. This is part 2 of the trilogy of the Ramsey numbers. Useful link: https://en.wikipedia.org/wiki/Ramsey%27s_theorem#2-colour_case Other than commenting on the
From playlist Ramsey trilogy
Introduction to Vertex Coloring and the Chromatic Number of a Graph
This video introduces vertex coloring and provides example of how to determine the chromatic number of a graph. mathispower4u.com
From playlist Graph Theory (Discrete Math)
Upper and Lower Bounds for the Chromatic Number of a Graph
This video explains how to determine the upper and lower bounds of the chromatic number to various graphs. Then the chromatic number is found. mathispower4u.com
From playlist Graph Theory (Discrete Math)
Find the Chromatic Number of the Given Graphs
This video explains how to determine a proper vertex coloring and the chromatic number of a graph. mathispower4u.com
From playlist Graph Theory (Discrete Math)
[Discrete Mathematics] Indexed Sets and Well Ordering Principle
Today we discuss indexed sets and the well ordering principle. Visit my website: http://bit.ly/1zBPlvm Subscribe on YouTube: http://bit.ly/1vWiRxW *--Playlists--* Discrete Mathematics 1: https://www.youtube.com/playlist?list=PLDDGPdw7e6Ag1EIznZ-m-qXu4XX3A0cIz Discrete Mathematics 2: http
From playlist Discrete Math 1
Vertex Colorings and the Chromatic Number of Graphs | Graph Theory
What is a proper vertex coloring of a graph? We'll be introducing graph colorings with examples and related definitions in today's graph theory video lesson! A proper coloring (or just: coloring) of a graph, G, is an assignment of colors (or, more generally, labels) to the vertices of G s
From playlist Graph Theory
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
Graph Theory: 64. Vertex Colouring
In this video we define a (proper) vertex colouring of a graph and the chromatic number of a graph. We discuss some basic facts about the chromatic number as well as how a k-colouring partitions the vertex set into k independent sets (check out video #50 for more about independent sets).
From playlist Graph Theory part-11
8ECM Invited Lecture: Daniela Kühn
From playlist 8ECM Invited Lectures
Live CEOing Ep 197: Geometry in Wolfram Language
Watch Stephen Wolfram and teams of developers in a live, working, language design meeting. This episode is about Geometry in the Wolfram Language.
From playlist Behind the Scenes in Real-Life Software Design
Graph list-coloring and Thomassen's theorem #SoME2
Some videos on topics that appear on the video: Induction: https://www.youtube.com/watch?v=5Hn8vUE3cBQ Planar graphs & four color theorem: https://www.youtube.com/watch?v=xBkTIp6ajAg https://www.youtube.com/watch?v=NgbK43jB4rQ Image credit: Francis Guthrie: Unknown author, Public domain,
From playlist Summer of Math Exposition 2 videos
Recent progress on Serre weight conjectures - Bao Le Hung
Topic: Recent progress on Serre weight conjectures Speaker: Bao Le Hung, University of Chicago Time/Room: 4:30pm - 5:30pm/S-101 More videos on http://video.ias.edu
From playlist Mathematics
K-groups and Global Fields by Haiyan Zhou
12 December 2016 to 22 December 2016 VENUE : Madhava Lecture Hall, ICTS Bangalore The Birch and Swinnerton-Dyer conjecture is a striking example of conjectures in number theory, specifically in arithmetic geometry, that has abundant numerical evidence but not a complete general solution.
From playlist Theoretical and Computational Aspects of the Birch and Swinnerton-Dyer Conjecture
GraphData: New Developments and Research Applications
GraphData is an extensive curated database of simple graphs and their properties available in Mathematica as a built-in data paclet and in Wolfram|Alpha via natural language queries. GraphData was first introduced in Mathematica Version 6, and the number of graphs, property count, and frac
From playlist Wolfram Technology Conference 2013
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
David Rosenthal - Finitely F-amenable actions and decomposition complexity of groups
38th Annual Geometric Topology Workshop (Online), June 15-17, 2021 David Rosenthal, St. John's University Title: Finitely F-amenable actions and decomposition complexity of groups Abstract: In their groundbreaking work on the Farrell-Jones Conjecture for Gromov hyperbolic groups, Bartels
From playlist 38th Annual Geometric Topology Workshop (Online), June 15-17, 2021
Stephan Garcia - LatMath 2022 - IPAM's Latinx in the Mathematical Sciences Conference
Recorded 09 July 2022. Stephan Garcia presents at IPAM's Latinx in the Mathematical Sciences Conference. Learn more online at: http://www.ipam.ucla.edu/programs/special-events-and-conferences/latinx-in-the-mathematical-sciences-conference-2022/
From playlist LatMath 2022 - IPAM's Latinx in the Mathematical Sciences Conference
Determine Which Graphs have a Given Chromatic Number
This video explains how to determine which special graphs have a chromatic number of 6. mathispower4u.com
From playlist Graph Theory (Discrete Math)
Small-set expansion in Grassman graph and the 2-to-2 Games Theorem (Lecture 1) by Prahladh Harsha
Discussion Meeting Workshop on Algebraic Complexity Theory  ORGANIZERS Prahladh Harsha, Ramprasad Saptharishi and Srikanth Srinivasan DATE & TIME 25 March 2019 to 29 March 2019 VENUE Madhava Lecture Hall, ICTS Bangalore Algebraic complexity aims at understanding the computationa
From playlist Workshop on Algebraic Complexity Theory 2019