Agt: Optimizing Eigenvalue Bounds For K-independence And K-chromatic Number

2022 42:51
Synopsis
Talk by Sjanne Zeijlemaker. The kth power of a graph G is the graph in which two distinct vertices are adjacent if their distance in ...

You Might Also Like

Sjanne Zeijlemaker - Optimization of eigenvalue bounds for the independence and chromatic number ... 19:11
Sjanne Zeijlemaker - Optimization Of Eigenvalue Bounds For T...
2022
Aida Abiad, Eigenvalue bounds for the independence and chromatic number of graph powers, 3-AGT-2020 53:50
Aida Abiad, Eigenvalue Bounds For The Independence And Chrom...
2021
AGT: The k-Independence Number 42:29
Agt: The K-independence Number
2022
AGT: New Eigenvalue Bound for the Fractional Chromatic Number 43:30
Agt: New Eigenvalue Bound For The Fractional Chromatic Numbe...
2023
AGT: Optimizing sums of eigenvalues 51:02
Agt: Optimizing Sums Of Eigenvalues
2023
Bounds on chromatic number, clique number, and independence number 33:41
Bounds On Chromatic Number, Clique Number, And Independence ...
2026
AGT: Why are Hoffman's bounds for alpha and chi truly duals of each other? 52:55
Agt: Why Are Hoffman's Bounds For Alpha And Chi Truly Duals ...
2022
AGT: Two Distinct Eigenvalues from a New Graph Product 25:25
Agt: Two Distinct Eigenvalues From A New Graph Product
2026
AGT: On sesqui-regular graphs with fixed smallest eigenvalue 1:01:41
Agt: On Sesqui-regular Graphs With Fixed Smallest Eigenvalu...
2023
AGT: Simple eigenvalues of graphs 47:09
Agt: Simple Eigenvalues Of Graphs
2021
AGT: Distinct Eigenvalues and Sensitivity 42:25
Agt: Distinct Eigenvalues And Sensitivity
2021
Download Options
Choose a download method below. All links open in new tabs.
Service Features Action
Ssvid
MP4 & MP3 • HD Quality • Browser Extension Available
Download
SaveFrom
MP4 & MP3 • HD Quality • Browser Extension Available
Download
Security Notice: These are third-party services. We recommend using antivirus software and being cautious of pop-up ads.