algebraic graph theory: optimizing eigenvalue bounds for k-independence and k-chromatic number
Published 3 years ago • 337 plays • Length 42:51Download video MP4
Download video MP3
Similar videos
-
42:25
algebraic graph theory: distinct eigenvalues and sensitivity
-
54:58
algebraic graph theory: some open problems related to eigenvalues of graphs
-
50:22
algebraic graph theory: minimum eigenvalue of nonbipartite graphs
-
19:11
sjanne zeijlemaker - optimization of eigenvalue bounds for the independence and chromatic number ...
-
53:28
algebraic graph theory: quantum independence number
-
43:30
agt: new eigenvalue bound for the fractional chromatic number
-
51:02
agt: optimizing sums of eigenvalues
-
52:55
algebraic graph theory: why are hoffman's bounds for alpha and chi truly duals of each other?
-
46:30
algebraic graph theory: the chromatic index of strongly regular graphs
-
1:03:17
algebraic graph theory: leonard pairs, spin models, and distance-regular graphs
-
39:31
algebraic graph theory: pseuodrandom cliquefree graphs, finite geometry, and spectra
-
53:00
algebraic graph theory: real chromatic roots of graphs
-
37:33
algebraic graph theory: perfect colorings of the generalized petersen graphs
-
38:58
algebraic graph theory: flip graph on perfect matchings of complete graphs and sign reversal graphs
-
1:00:21
algebraic graph theory: scaffolds
-
56:16
algebraic graph theory: cospectral vertices and isospectral reductions
-
46:20
algebraic graph theory: a covering graph perspective on huang’s theorem