人民棋牌APP

    1. <input id="xdzxf"><acronym id="xdzxf"></acronym></input>
      <input id="xdzxf"></input>
    2. <input id="xdzxf"><output id="xdzxf"><rt id="xdzxf"></rt></output></input>
      <input id="xdzxf"></input>

      <sub id="xdzxf"><code id="xdzxf"></code></sub>
    3. 
      
      1. Home  |  Sitemap  |  Contact Us  |  中文

        Home > Events > Content
        Lecture on “Monochromatic connected matchings, paths and cycles in 2-edge-colored multipartite graphs”
        DateandTime: 2019-08-05 19:46:55

        Lecture on “Monochromatic connected matchings, paths and cycles in 2-edge-colored multipartite graphs


        Speaker: Xujun Liu, University of Illinois at Urbana-Champaign (UIUC)

        Date: Aug. 13, 2019

        Time: 9:00 am

        Location: Lecture Hall 1032, Block B, Zhixin Building, Central Campus

        Sponsor: School of Mathematics


        Abstract:

        We solve four similar problems: For every fixed s and large n, we describe all values of n1, …, ns such that for every 2-edge-coloring of the complete s-partite graph Kn1,...,ns there exists a monochromatic (i) cycle C2n with 2n vertices, (ii) cycle C≥2n with at least 2n vertices, (iii) path P2n with 2n vertices, and (iv) path P2n+1 with 2n + 1 vertices. This implies a generalization of the conjecture by Gy′arf′as, Ruszink′o, S′ark?ozy and Szemer′edi that for every 2-edge-coloring of the complete 3-partite graph Kn,n,n there is a monochromatic path P2n+1. An important tool is our recent stability theorem on monochromatic connected matchings (A matching M in G is connected if all the edges of M are in the same component of G). We will also talk about exact Ramsey-type bounds on the sizes of monochromatic connected matchings in 2-colored multipartite graphs. Moreover, we will talk about the existence of long monochromatic paths and cycles in 2-edge-colored graphs with large minimum degree. Joint work with J′ozsef Balogh, Alexandr Kostochka and Mikhail Lavrov.


        For more information, please visit:

        http://www.math.sdu.edu.cn/info/1020/12181.htm?tdsourcetag=s_pcqq_aiomsg


        Edited by Wei Zhen








        Copyright 2011 © All rights reserved, Network Center, Shandong University    |    englishweb@sdu.edu.cn

        Copyright © 2019.人民棋牌APP All rights reserved.www.lyt5q.cn

        天津福彩网首页| 981棋牌官方下载| 北京体彩11选五| bobo棋牌APP| 88棋牌下载| 大乐透彩票开奖结果