Randomized Greedy Algorithm for Independent Sets in Regular Uniform Hypergraphs_哔哩哔哩_bilibili

Name: Randomized Greedy Algorithm for Independent Sets in Regular Uniform Hypergraphs
Uploaded: 2022-01-10T15:24:11.000Z
Duration: 56 min
Channel: 极值组合资料
Description: SCMS Combinatorics Online Seminar 2022/01/10 check our schedule and more talks at scmscomb.github.io 报告人 聂家熹 Jiaxi Nie (University of California San Diego)

极值组合资料

SCMS Combinatorics Online Seminar 2022/01/10check our schedule and more talks at scmscomb.github.io报告人 聂家熹 Jiaxi Nie (University of California San Diego), 视频播放量 739、弹幕量 0、点赞数 9、投硬币枚数 8、收藏人数 9、转发人数 3, 视频作者 极值组合资料, 作者简介 发一些关于极值组合的talk，相关视频：Yifan Jing (Oxford): Sidon sets and sum-product phenomena，Bo Ning (南开大学) A spectral condition for cycles with consecutive lengths，Yufei Zhao (MIT): Equiangular lines，Shichang Song (北京交通大学): Applications of nonstandard analysis to graphon theory，林志聪 (山东大学): Permanents and permutation statistics，李若楠(西北工业大学): Properly colored cycles in graphs and directed cycles in digraphs，林辉球 (华东理工大学) On sum of powers of graph eigenvalues: problems and progress，陈耀俊（南京大学）：Ramsey numbers concerning quadrilaterals，Yijia Chen (上海交通大学) Lovász meets Łoś and Tarski，王周宁馨 (Université Paris Cité): Density of C_{−4}-critical signed graphs