英文
【会议】The 5th Xi’an International Workshop on Graph Theory and Combinatorics Program
浏览量：
The 5th Xi’an International Workshop on Graph Theory and Combinatorics Program
| Location: ZOOM Meeting 767 297 7211 Passcode: xian | ||||
| June 26, Saturday | ||||
| 13:45-14:00 | Opening Ceremony Chair: Xueliang Li | |||
| Beijing Time | Chair | Talker | Title | |
| 14:00-14:45 | Shenggui Zhang | Gyula O.H. Katona | The forbidden poset problem | |
| 14:45-15:30 | Jiuqiang Liu | EKR-type theorems and recent developments | ||
| 15:30-15:45 | Break | |||
| 15:45-16:30 | Yongtang Shi | Miklós Simonovits | Open problems in extremal graph theory | |
| 16:30-17:15 | Yuejian Peng | Turán densities and Lagrangian densities of hypergraphs | ||
| 17:15-19:00 | Break | |||
| 19:00-19:45 | Yaping Mao | Ingo Schiermeyer | Gallai Ramsey numbers of complete graphs and odd cycles | |
| 19:45-20:30 | Dragan Stevanović | On circulant nut graphs | ||
| 20:30-20:45 | Break | |||
| 20:45-21:30 | You Lu | Cun-Quan Zhang | On Berge-Fulkerson conjecture | |
| 21:30-22:15 | Guantao Chen | On the Goldberg-Seymour conjecture and surrounding edge-coloring problems | ||
June 27, Sunday |
||||
| 14:00-14:45 | Xiaoyan Zhang | Gregory Gutin | Kings in multipartite hypertournaments | |
| 14:45-15:30 | Daniel Paulusma | Contracting to a longest path in H-free graphs | ||
| 15:30-15:45 | Break | |||
| 15:45-16:15 | Xin Zhang | Shinya Fujita | Some results on optimal proper connection number in edge-colored graphs | |
| 16:15-16:45 | Ringi Kim | The strong clique index of graphs with forbidden cycles | ||
| 16:45-17:15 | Ruonan Li | Properly colored cycles and forbidden structures | ||
| 17:15-19:00 | Break | |||
| 19:00-19:45 | Yandong Bai | Linyuan Lu | Anti-Ramsey number of edge-disjoint rainbow spanning trees in all graphs | |
| 19:45-20:30 | Zi-Xia Song | The Erdős-Lovász Tihany conjecture | ||
| 20:30-20:45 | Break | |||
| 20:45-21:30 | Ligong Wang | Xuding Zhu | Every nice graph is (1,5)-choosable | |
| 21:30-22:15 | Hong-Jian Lai | Some progresses in the study of supereulerian digraphs | ||
| 22:15-22:45 | Boram Park | Decomposing planar graphs under degree restriction | ||
June 28, Monday |
||||
| 14:00-14:45 | Wei Wang | Douglas B. West | Acyclic graphs with at least 2l+1 vertices are l-recognizable | |
| 14:45-15:30 | Hehui Wu | 1-subdivision, the fractional chromatic number, and the Hall ratio | ||
| 15:30-15:45 | Break | |||
| 15:45-16:30 | Xiaogang Liu | Caiheng Li | Two-arc transitive Cayley graphs | |
| 16:30-17:15 | Sanming Zhou | Perfect 2-colourings of Cayley graphs | ||
| 17:15-17:45 | Jinxin Zhou | Bi-Cayley graphs and vertex-transitive non-Cayley graphs | ||
| 17:45-19:00 | Break | |||
| 19:00-19:45 | Jing Li | Zhongshan Li | Minimum rank and cycle conditions for sign patterns that allow diagonalizability | |
| 19:45-20:30 | Libo Yang | Kazhdan-Lusztig polynomials for uniform matroids | ||
| 20:30-20:45 | Break | |||
| 20:45-21:30 | FenjinLiu | Jianfeng Hou | On Min-Bisections of graphs | |
| 21:30-22:15 | Gyula Y. Katona | Minimally t-tough graphs | ||
June 29, Tuesday |
||||
| 14:00-14:45 | JianfengWang | Weifan Wang | Acyclic coloring of graphs | |
| 14:45-15:30 | Jie Ma | Improvements on induced subgraphs of given sizes | ||
| 15:30-15:45 | Break | |||
| 15:45-16:30 | Hongliang Lu | Hao Li | Rainbow cycles and alternative trees in edge colored graphs | |
| 16:30-17:15 | Guanghui Wang | Rainbow structures in graph systems | ||
| 18:00-19:00 | Break | |||
| 19:00-19:45 | Wei Li | Carol T. Zamfirescu | Hamiltonian cycles and 1-factors in 5-regular graphs | |
| 19:45-20:30 | Edwin R. van Dam | Several adjacency matrices for digraphs and their spectra | ||
| 20:30-20:45 | Break | |||
| 20:45-21:15 | Chuandong Xu | Binlong Li | On an extremal problem of Erdős, Faudree, Schelp and Simonovits | |
| 21:15-21:45 | Bo Ning | A spectral condition for cycles with consecutive lengths: a Ramsey Theory approach | ||
| 21:45-22:15 | Lulu Gao | The equivariant inverse Kazhdan-Lusztig polynomials of uniform matroids | ||
| 22:15-22:30 | Closing Ceremony Chair: Shenggui Zhang | |||
Program Committee
Chair:Xueliang Li
Members:Hajo Broersma, Gyula O.H. Katona, Miklós Simonovits, Hao Li, Xueliang Li,
You Lu, Ligong Wang, Shenggui Zhang
Organizing Committee
Chair:Shenggui Zhang
General Secretary:Yandong Bai
Members:Yandong Bai, Lulu Gao, Binlong Li, Jing Li, Ruonan Li, Wei Li, Xia
Liu, Xiaogang Liu, You Lu, Ligong Wang, Jia Wei, Shenggui Zhang
Sponsors
Northwestern Polytechnical University
CSIAM Activity Group on Graph Theory and Combinatorics with Applications
微信二维码