Discrete Math II - 10.8.1 Graph Coloring
This video focuses on graph coloring, in which color the vertices of a graph so that no two adjacent vertices have the same color. Most often, graph coloring is used for scheduling purposes, as we can determine when there are conflicts in scheduling if two vertices are the same color. Vi
From playlist Discrete Math II/Combinatorics (entire course)
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
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)
Graph Coloring is NP-Complete - Intro to Algorithms
This video is part of an online course, Intro to Algorithms. Check out the course here: https://www.udacity.com/course/cs215.
From playlist Introduction to Algorithms
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
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
Math for Liberal Studies: The Greedy Coloring Algorithm
In this video, we use the Greedy Coloring Algorithm to solve a couple of graph coloring problems. For more info, visit the Math for Liberal Studies homepage: http://webspace.ship.edu/jehamb/mls/index.html
From playlist Math for Liberal Studies
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)
Complexity, Phase Transitions, and Inference by Cristopher Moore (Part 3)
There is a deep analogy between statistical inference and statistical physics. I will give a friendly introduction to both of these fields. I will then discuss phase transitions in problems like community detection in networks, and clustering of sparse high-dimensional data, where if our
From playlist Turing Lectures
The Colorful Connected Subgraph Problem - Richard Karp
A Celebration of Mathematics and Computer Science Celebrating Avi Wigderson's 60th Birthday October 5 - 8, 2016 More videos on http://video.ias.edu
From playlist Mathematics
High dimensional expansion and agreement testing - Irit Dinur
Computer Science/Discrete Mathematics Seminar II Topic: High dimensional expansion and agreement testing Speaker: Irit Dinur Affiliation: Weizmann Institute of Science; Visiting Professor, School of Mathematics Date: March 31, 2020 For more video please visit http://video.ias.edu
From playlist Mathematics
Epidemics on networks: thresholds and control strategies by AJ Ganesh (Part 2)
Games, Epidemics and Behavior URL: http://www.icts.res.in/discussion_meeting/geb2016/ DATES: Monday 27 Jun, 2016 - Friday 01 Jul, 2016 VENUE : Madhava lecture hall, ICTS Bangalore DESCRIPTION: The two main goals of this Discussion Meeting are: 1. To explore the foundations of policy d
From playlist Games, Epidemics and Behavior
Asymptotic enumeration of graphs with given degree sequence – Nicholas Wormald – ICM2018
Combinatorics Invited Lecture 13.7 Asymptotic enumeration of graphs with given degree sequence Nicholas Wormald Abstract: We survey results on counting graphs with given degree sequence, focusing on asymptotic results, and mentioning some of the applications of these results. The main re
From playlist Combinatorics
Journey trough statistical physics of constraint satisfaction and inference by Lenka Zdeborova
26 December 2016 to 07 January 2017 VENUE: Madhava Lecture Hall, ICTS Bangalore Information theory and computational complexity have emerged as central concepts in the study of biological and physical systems, in both the classical and quantum realm. The low-energy landscape of classical
From playlist US-India Advanced Studies Institute: Classical and Quantum Information
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
Modeling limits - P. Ossona de Mendez - Workshop 1 - CEB T1 2018
Patrice Ossona de Mendez (EHSS) / 30.01.2018 A sequence of graphs is FO-convergent if the probability of satisfaction of every first-order formula converges. A graph modeling is a graph, whose domain is a standard probability space, with the property that every definable set is Borel. It
From playlist 2018 - T1 - Model Theory, Combinatorics and Valued fields
Phase transitions of random constraint satisfaction problems – Allan Sly – ICM2018
Probability and Statistics Invited Lecture 12.5 Phase transitions of random constraint satisfaction problems Allan Sly Abstract: Random constraint satisfaction problems encode many interesting questions in the study of random graphs such as the chromatic and independence numbers. Ideas f
From playlist Probability and Statistics
Constraint Satisfaction Problems and Probabilistic Combinatorics I - Fotios Illiopoulos
Computer Science/Discrete Mathematics Seminar II Topic: Constraint Satisfaction Problems and Probabilistic Combinatorics I Speaker: Fotios Illiopoulos Affiliation: Member, School of Mathematics Date: November 19, 2019 For more video please visit http://video.ias.edu
From playlist Mathematics
Nevanlinna Prize Lecture: Equilibria and fixed points — Constantinos Daskalakis — ICM2018
Equilibria, fixed points, and computational complexity Constantinos Daskalakis Abstract: The concept of equilibrium, in its various forms, has played a central role in the development of Game Theory and Economics. The mathematical properties and computational complexity of equilibria are
From playlist Special / Prizes Lectures
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)