COG. Towards a structure theory for vertex minors.
Speaker: Paul Joseph Wollan Lecture date: 17.05.2019.
Лекторий ФПМИ
Cutwidth in Semi-complete Digraphs
Talk by Michał Pilipczuk at WorKer 2019. Location: University of Bergen, Norway.
WorKer 2019
Distributed Optimization Algorithms via Low-Congestion Shortcuts
Bernhard Haeupler, Carnegie Mellon University I-Core Day Tel Aviv University 18.9.17.
TAUVOD
Network Flows: Max-Flow Min-Cut Theorem (& Ford-Fulkerson Algorithm)
Things I'd Improve On This Explanation (w/ More Time): 1.) I should have done a walk-through showing how the residual graph dictates how the original graph's ...
Back To Back SWE
Ralf Borndörfer - Vehicles & Crews
Movie-Soundtrack Quiz: Find the hidden youtube link that points to a soundtrack from a famous movie. The 3rd letter of the movie title is the 7th letter of the final ...
Mixed Integer Programming
Macaulay 2 Tutorial II
Daniel Grayson, University of Illinois, Urbana‑Champaign Symbolic and Numerical Methods for Tensors and Representation Theory ...
Simons Institute
Lecture 37 . Polytopes (Federico Ardila)
More on the characteristic polynomial of a hyperplane arrangement. We explore the evaluation of the Mo ̈bius function for a flat in the lattice of flats of a ...
Federico Ardila
What is a Clique? | Graph Theory, Cliques
What is a clique? A clique in graph theory is an interesting concept with a lot of depth to explore. We define the term and give some examples in today's math ...
Wrath of Math
MIGHTY LVIII Doug West - Reconstruction from the deck of k-vertex induced subgraphs
Plenary talk given by Doug West during MIGHTY LVIII at Grand Valley State University on Oct. 7, 2017.
GVSUmath
Feb 1. Talk 3. Diameter graphs in R^4
A. Kupavskii "Diameter graphs in R^4" February, 1. 2014 Moscow Workshop on Combinatorics and Number Theory: ...
Moscow Workshop on Combinatorics and Number Theory
Episode 1 - Trees and Diameters
This week I will present some properties of trees and how to find useful information about a given tree quickly. I'll also prove the correctness of these techniques.
Algorithms Live!
Graph limit theory: an overview - Laszlo Lovasz
Laszlo Lovasz June 4, 2012 For more videos, visit http://video.ias.edu.
Institute for Advanced Study
4 9 Defining the Graph Laplacian 3 27 Advanced
Mining Massive Datasets
Algebraic Graph Theory: Simple eigenvalues of graphs
Talks by Krystal Guo. If v is an eigenvector for eigenvalue λ of a graph X and α is an automorphism of X, then α(v) is also an eigenvector for λ. Thus it is rather ...
Combinatorics & Optimization University of Waterloo
Graph Theory Classes Episode 5
Episode 5: In this episode various theorems related to connectedness and based on bounds of vertices, edges and components of a graph are discussed and ...
Sg Online
Bojan Mohar - Lecture 1, Minicourse "Graphs and their eigenvalues"
International Conference and PhD-Master Summer School on Graphs and Groups, Spectra and Symmetries (G2S2) 15 – 28 August 2016, Akademgorodok, ...
G2 Conference
Lossy Kernelization: Tutorial 2
Talk by Fahad Panolan at WorKer 2019. Location: University of Bergen, Norway.
WorKer 2019
SiGMa 2017 Paul Seymour, Rainbow induced paths in graphs with large chromatic & small clique number
SiGMa is a workshop bringing together researchers from Graph Theory and Matroid Theory, with a focus on structure theory. The topics of the workshop include ...
Combinatorics & Optimization University of Waterloo
b-Matching Games: A Case Study in Computing the Nucleolus on Graphs of Bounded Treewidth
Talk given by Justin Toth on May 29th, 2020.
CombOpt Reading Group
Eriko Hironaka - Small dilatations pseudo-Anosov mapping classes
Georgia Topology Conference 2014 The smallest known accumulation point for dilatations of pseudo-Anosov mapping classes normalized by Euler ...
Georgia Topology
Daniel T. Wise -Counting cycles in graphs: A rank-1 version of the Hanna Neumann Conjecture
Daniel T. Wise (McGill University) Counting cycles in graphs: A rank-1 version of the Hanna Neumann Conjecture.
Israel Institute for Advanced Studies
2021.01.05, O-joung Kwon (권오정), Directed tangles and applications
IBS Discrete Mathematics Group Discrete Math Seminar O-joung Kwon (권오정), Directed tangles and applications January 5 2021, Tuesday @ 4:30 PM ~ 5:30 ...
IBS Discrete Mathematics Group
Graphs with Possible Loops -- Pavol Hell
I will discuss a few examples of concepts that have interesting extensions if loops are allowed (but not required). I will include interval graphs, strongly chordal ...
matsciencechannel
Controllability and Observability of Complex Systems - Yang-Yu Liu
YANG-YU LIU, Northeastern University, Center for Complex Network Research, Physics Department Controllability and Observability of Complex Systems ...
Guillaume Institut des sciences cognitives
2020-05-12 Eun Jung Kim (김은정), Twin-width: tractable FO model checking
IBS Discrete Mathematics Group Discrete Math Seminar Eun Jung Kim (김은정), Twin-width: tractable FO model checking May 12 2020, Tuesday @ 4:30 PM ...
IBS Discrete Mathematics Group
David Conlon - Hypergraph expanders from Cayley graphs
Israel Institute for Advanced Studies
Wolfram Physics I: Basic Formalism, Causal Invariance and Special Relativity
Follow us on our official social media channels. Twitter: https://twitter.com/WolframResearch Facebook: https://www.facebook.com/wolframresearch Instagram: ...
Wolfram
AMATH Seminar: Random walks on graphs and hypergraphs: eigenvalues and clustering
AMATH Seminar, October 15, 2020 Sinan Askoy Pacific Northwest National Laboratory Title: Random walks on graphs and hypergraphs: eigenvalues and ...
UW Applied Mathematics
2009 eScience: Using Multipartite Graphs for Recommendation and Discovery
Microsoft Research
KITE VICTERS Plus two Mathematics Class 06 (First Bell-ഫസ്റ്റ് ബെല്)
സംസ്ഥാനത്തെ സ്കൂൾ കുട്ടികൾക്ക് സാങ്കേതിക സൗകര്യങ്ങൾ പ്രയോജനപ്പെടുത്തിക്കൊണ്ടു കൈറ്റ് വിക്ടേഴ്സ് ചാനല് ...
itsvicters
Twice-Ramanujan Sparsifiers
We prove that every graph has a spectral sparsifier with a number of edges linear in its number of vertices. As linear-sized spectral sparsifiers of complete ...
Microsoft Research
Planar Separator Theorem
In graph theory, the planar separator theorem is a form of isoperimetric inequality for planar graphs, that states that any planar graph can be split into smaller ...
Wikipedia Reader
Mod-03 Lec-21 Chromatic polynomial, k - critical graphs
Graph Theory by Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore. For more details on NPTEL visit http://nptel.iitm.ac.in.
nptelhrd
DISC 2020 session 8
0:00 Opening of the session 0:09 Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond 5:55 Distributed Constructions of ...
PODC–DISC
Bob Coecke: "Graphical and Automated Reasoning for Quantum Algorithms and Protocols"
Speaker: Bob Coecke (University of Oxford) Title: Graphical and Automated Reasoning for Quantum Algorithms and Protocols Event: QISW 2012 (University of ...
OxfordQuantumVideo
SiGMa 2017 Paul Wollan, A shorter proof for the graph minor structure theorem with explicit bounds
SiGMa is a workshop bringing together researchers from Graph Theory and Matroid Theory, with a focus on structure theory. The topics of the workshop include ...
Combinatorics & Optimization University of Waterloo
Episode 23 - Strongly Connected Components
This week's episode will cover how to use lowlinking to extract the strongly connected components from directed graphs. 00:58 Definition of strongly connected ...
Algorithms Live!
Mod-04 Lec-28 Boxicity,Sphericity, Hamiltonian circuits
Graph Theory by Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore. For more details on NPTEL visit http://nptel.iitm.ac.in.
nptelhrd
Vic Reiner, Lecture III - 13 February 2015 (49)
Many results in the combinatorics and invariant theory of reflection groups have q-analogues for the finite general linear groups GLn(Fq). These lectures will ...
SNS Channel Mathematical and Natural Sciences
Matroid Seminar - Tony Huynh
Subgraph densities in a surface - from August 31, 2020.
Combinatorics & Optimization University of Waterloo
Ori Parzanchevski: Random walks on Ramanujan complexes and digraphs
Ori Parzanchevski (HUJI) - Random walks on Ramanujan complexes and digraphs.
Israel Institute for Advanced Studies
Distributed Planar Reachability in Nearly Optimal Time
By Merav Parter, from DISC 2020, 34th International Symposium on Distributed Computing, http://www.disc-conference.org/wp/disc2020/ Paper: ...
PODC–DISC
