星游棋牌官方下载

<var id="dauhw"></var>
    <sub id="dauhw"><label id="dauhw"><u id="dauhw"></u></label></sub>
  1. <var id="dauhw"></var>
    <input id="dauhw"></input>

    <var id="dauhw"></var>
      <var id="dauhw"></var>
      1. <table id="dauhw"></table>

            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.星游棋牌官方下载 All rights reserved.www.vmpy.cn

              516棋牌下载| 966棋牌APP| 8号棋牌下载| 大海棋牌官方下载| 体彩七星彩| 中国福利彩票正版下载