ycliper

Популярное

Музыка Кино и Анимация Автомобили Животные Спорт Путешествия Игры Юмор

Интересные видео

2025 Сериалы Трейлеры Новости Как сделать Видеоуроки Diy своими руками

Топ запросов

смотреть а4 schoolboy runaway турецкий сериал смотреть мультфильмы эдисон
Скачать

Proof: If There is a u-v Walk then there is a u-v Path | Every Walk Contains a Path, Graph Theory

Автор: Wrath of Math

Загружено: 2019-10-30

Просмотров: 27081

Описание: Support the production of this course by joining Wrath of Math to access all my graph theory videos!
   / @wrathofmath  
🛍 Check out my math fashion brand! https://mathshion.com/

Graph Theory course:    • Graph Theory  
Graph Theory exercises:    • Graph Theory Exercises  

Get the textbook! https://amzn.to/3HvI535

PLEASE NOTE: The condition that u is not equal to v is not technically necessary, because the path described by the sequence ( u ) is considered a u-u path of length 0. If we allow this to be a path, the proof we go over covers this possibility with no changes necessary, and so the theorem is proved for all walks, regardless of whether u and v are equal or not.

If there is a u-v walk of length n in a graph, then there is a u-v path of length at most n, provided that u is not equal to v. We will prove this simple but useful result in today's video graph theory lesson!

It should seem fairly self-evident that the existence of a walk between two vertices implies the existence of a path between those vertices that is at most as long as the walk. If a walk is not a path, then it must repeat vertices, the vertices visited between the duplicate vertices can be deleted, leaving a shorter walk behind. If this process is repeated as much as possible, a path will be created.

If we know a u-v walk exists, we can take a shortest u-v walk. Then we use proof by contradiction and show this shortest walk, if it is not a path, can be shortened, producing a contradiction and proving the shortest walk must be a path.

If you're taking a course in Graph Theory, or preparing to, you may be interested in the textbook that introduced me to Graph Theory: “A First Course in Graph Theory“ by Gary Chartrand and Ping Zhang. It’s a wonderful text! You can purchase this book through my Amazon affiliate link below! Using the affiliate link costs you nothing extra, and helps me continue to work on Wrath of Math!

◆ Support Wrath of Math on Patreon:   / wrathofmathlessons  

Follow Wrath of Math on...
● Instagram:   / wrathofmathedu  
● Facebook:   / wrathofmath  
● Twitter:   / wrathofmathedu  

Не удается загрузить Youtube-плеер. Проверьте блокировку Youtube в вашей сети.
Повторяем попытку...
Proof: If There is a u-v Walk then there is a u-v Path | Every Walk Contains a Path, Graph Theory

Поделиться в:

Доступные форматы для скачивания:

Скачать видео

  • Информация по загрузке:

Скачать аудио

Похожие видео

What is a Circuit? | Graph Theory

What is a Circuit? | Graph Theory

Proof: Two Longest Paths Have a Common Vertex | Graph Theory, Connected Graphs

Proof: Two Longest Paths Have a Common Vertex | Graph Theory, Connected Graphs

Помимо числа Пи, существуют и другие константы.

Помимо числа Пи, существуют и другие константы.

ГАЛИЯ ШАРАФЕТДИНОВА!!!!! 42 из 42 НА МЕЖНАРЕ-2022!! РАЗБОР ЗАДАЧ МЕЖНАРА С АБСОЛЮТНОЙ ЧЕМПИОНКОЙ!

ГАЛИЯ ШАРАФЕТДИНОВА!!!!! 42 из 42 НА МЕЖНАРЕ-2022!! РАЗБОР ЗАДАЧ МЕЖНАРА С АБСОЛЮТНОЙ ЧЕМПИОНКОЙ!

Intro to Tree Graphs | Trees in Graph Theory, Equivalent Definitions

Intro to Tree Graphs | Trees in Graph Theory, Equivalent Definitions

Graph Theory

Graph Theory

Graph Theory: 18. Every Walk Contains a Path

Graph Theory: 18. Every Walk Contains a Path

Solving Wordle using information theory

Solving Wordle using information theory

Как Гений Математик разгадал тайну вселенной

Как Гений Математик разгадал тайну вселенной

Newton’s fractal (which Newton knew nothing about)

Newton’s fractal (which Newton knew nothing about)

math slop has hit a new low!

math slop has hit a new low!

Proof: Dirac's Theorem for Hamiltonian Graphs | Hamiltonian Cycles, Graph Theory

Proof: Dirac's Theorem for Hamiltonian Graphs | Hamiltonian Cycles, Graph Theory

Это был полный П***Ц! Этот ПАРАМЕТР не решил НИКТО | ЕГЭ 2025

Это был полный П***Ц! Этот ПАРАМЕТР не решил НИКТО | ЕГЭ 2025

How to Tell if Graph is Bipartite (by hand) | Graph Theory

How to Tell if Graph is Bipartite (by hand) | Graph Theory

If G is a tree iff Every pair of vertices connected by unique path || #graphtheory

If G is a tree iff Every pair of vertices connected by unique path || #graphtheory

Парадокс дней рождения | Лекции по математике – математик Алексей Савватеев | Научпоп

Парадокс дней рождения | Лекции по математике – математик Алексей Савватеев | Научпоп

The Intuition Behind Proof by Induction

The Intuition Behind Proof by Induction

Proof: Graph has a Cycle Longer than its Minimum Degree | Graph Theory

Proof: Graph has a Cycle Longer than its Minimum Degree | Graph Theory

ДВИ МГУ. Легендарный мехмат возрождается? Разбор экзамена с Савватеевым

ДВИ МГУ. Легендарный мехмат возрождается? Разбор экзамена с Савватеевым

Комплексные числа: коротко и понятно – Алексей Савватеев | Лекции по математике | Научпоп

Комплексные числа: коротко и понятно – Алексей Савватеев | Лекции по математике | Научпоп

© 2025 ycliper. Все права защищены.



  • Контакты
  • О нас
  • Политика конфиденциальности



Контакты для правообладателей: [email protected]