Graph coloring | Theorems in graph theory
In graph theory, Brooks' theorem states a relationship between the maximum degree of a graph and its chromatic number. According to the theorem, in a connected graph in which every vertex has at most Δ neighbors, the vertices can be colored with only Δ colors, except for two cases, complete graphs and cycle graphs of odd length, which require Δ + 1 colors. The theorem is named after R. Leonard Brooks, who published a proof of it in 1941. A coloring with the number of colors described by Brooks' theorem is sometimes called a Brooks coloring or a Δ-coloring. (Wikipedia).
In this video, I give a very neat and elegant proof of Taylor’s theorem, just to show you how neat math can be! It is simply based on repeated applications of the fundamental theorem of calculus. Enjoy! Note: The thumbnail is taken from https://i.redd.it/kv7lk5kn31e01.jpg
From playlist Calculus
Images in Math - Pascal's Theorem
This video is about Pascal's Theorem.
From playlist Images in Math
Theory of numbers: Congruences: Euler's theorem
This lecture is part of an online undergraduate course on the theory of numbers. We prove Euler's theorem, a generalization of Fermat's theorem to non-prime moduli, by using Lagrange's theorem and group theory. As an application of Fermat's theorem we show there are infinitely many prim
From playlist Theory of numbers
Calculus - The Fundamental Theorem, Part 1
The Fundamental Theorem of Calculus. First video in a short series on the topic. The theorem is stated and two simple examples are worked.
From playlist Calculus - The Fundamental Theorem of Calculus
Approximating a function with a Taylor Polynomial More free lessons at: http://www.khanacademy.org/video?v=8SsC5st4LnI
From playlist Calculus
Theory of numbers: Gauss's lemma
This lecture is part of an online undergraduate course on the theory of numbers. We describe Gauss's lemma which gives a useful criterion for whether a number n is a quadratic residue of a prime p. We work it out explicitly for n = -1, 2 and 3, and as an application prove some cases of Di
From playlist Theory of numbers
Number Theory | Lagrange's Theorem of Polynomials
We prove Lagrange's Theorem of Polynomials which is related to the number of solutions to polynomial congruences modulo a prime.
From playlist Number Theory
Maclaurin series and applications
Free ebook http://bookboon.com/en/learn-calculus-2-on-your-mobile-device-ebook Basic example on Maclaurin series and some applications. In mathematics, a Taylor series is a representation of a function as an infinite sum of terms that are calculated from the values of the function's deriv
From playlist A second course in university calculus.
Prob & Stats - Bayes Theorem (1 of 24) What is Bayes Theorem?
Visit http://ilectureonline.com for more math and science lectures! In this video I will explain what is and define the symbols of Bayes Theorem. Bayes Theorem calculates the probability of an event or the predictive value of an outcome of a test based on prior knowledge of condition rela
From playlist PROB & STATS 4 BAYES THEOREM
Intro to Nielsen fixed point theory
A talk given by Chris Staecker at King Mongkut's University of Technology Thonburi, Bangkok, Thailand, on October 10 2019. Covers basic definitions and results of Nielsen fixed point theory, plus a few minutes about Nielsen-type theories for coincidence and periodic points. Should be und
From playlist Research & conference talks
Graph Theory: 66. Basic Bound on the Chromatic Number
In this video we prove by induction that every graph has chromatic number at most one more than the maximum degree. Odd cycles and complete graphs are examples for which the chromatic number meets this upper bound exactly. For other graphs, Brook's Theorem tells us that the chromatic num
From playlist Graph Theory part-11
The history of Taylor Series and Maclaurin Series including the works of de Lagny, Halley, Gregory, and Madhava using primary sources whenever possible. Lesson also presents the Taylor Theorem along with visualizations of James Gregory's equations. Finally the video discusses the time peri
From playlist Numerical Methods
E. Floris - Birational geometry of foliations on surfaces (Part 2)
The goal of this minicourse is to introduce MMP for foliations on surfaces and to outline the classification of foliations on projective surfaces up to birational equivalence.
From playlist Ecole d'été 2019 - Foliations and algebraic geometry
This lecture give an overview of Chern classes of nonsingular algebraic varieties. We first define the Chern class of a lline bundle by looking at the cycle of zeros of a section. Then we define Chern classes of higher rank vector bundles by looking at the line bundle O(1) over the corresp
From playlist Algebraic geometry: extra topics
Matthew Stover: Variations on an example of Hirzebruch
Abstract: In '84, Hirzebruch constructed a very explicit noncompact ball quotient manifold in the process of constructing smooth projective surfaces with Chern slope arbitrarily close to 3. I will discuss how this and some closely related ball quotients are useful in answering a variety of
From playlist Algebraic and Complex Geometry
This lecture is part of an online course on schemes, following the book "Algebraic geometry" by Hartshorne. In this lecture we discuss a relative version of the construction of a projective scheme from a graded algebra, special cases of which give projective space bundles and the blowup
From playlist Algebraic geometry II: Schemes
This lecture is part of an online course on algebraic geometry, following the book "Algebraic geometry" by Hartshorne. It is the first of a few elementary lectures on the Riemann-Roch theorem, mostly for compact complex curves. In this lecture we state the Riemann Roch theorem and explain
From playlist Algebraic geometry: extra topics
Rodney Brooks - Is the Cosmos a Computer?
That the cosmos is a computer sounds like a modern metaphor, a way of explaining how things work. But some make a bolder claim: that the cosmos is in reality a computer, not just as metaphor. This would mean that all that exists in the physical universe is in essence the computational proc
From playlist Closer To Truth - Rodney Brooks Interviews
Math 031 041917 Taylor's Theorem and the Lagrange Remainder Theorem (no sound)
Motivation: how do you know of the Taylor series converges back to the original function? Statement of Taylor's Theorem (+ Lagrange Remainder Formula). Example application: showing that the Taylor series for the sine recovers the sine (at x = 1; then for general x). Same application for
From playlist Course 3: Calculus II (Spring 2017)
85 Years of Nielsen Theory: Coincidence Points
Part 3 of a 3 part series of expository talks on Nielsen theory I gave at the conference on Nielsen Theory and Related Topics in Daejeon Korea, June 27, 2013. Part 1- Fixed Points: http://youtu.be/1Ls8mTkRtX0 Part 3- Coincidence Points: http://youtu.be/Wu2Cr3v_I44 Chris Staecker's intern
From playlist Research & conference talks