当前位置: 首页/ 学术报告

H-factors in graphs with sublinear independence number

发布时间:2023-01-03 浏览量:72

时   间:  2023-01-03 10:00 — 11:00

地   点:  腾讯会议 APP()
报告人:  韩杰
单   位:  北京理工大学
邀请人:  汪彦
备   注:  #腾讯会议:688-828-911 会议密码:230103
报告摘要:  

There has been a recent tread in finding spanning subgraphs in (host) graphs with sublinear independence number. In this talk we study the H-factors problem in such a setting. That is, given a graph H, what is the best possible minimum degree condition forcing an H-factor in a graph G with independence number o(|G|)? Joint work with Ming Chen, Guanghui Wang and Donglei Yang.