Zi-Xia Song (宋梓霞), Ramsey numbers of cycles under Gallai colorings
For a graph $H$ and an integer $k\ge1$, the $k$-color Ramsey number $R_k(H)$ is the least integer $N$ such that every $k$-coloring of the edges of the complete graph $K_N$ …
10 events found.
Events
-
-
Room B232 IBS (기초과학연구원)
-
Joonkyung Lee (이준경), On some properties of graph norms
Room B232 IBS (기초과학연구원)For a graph $H$, its homomorphism density in graphs naturally extends to the space of two-variable symmetric functions $W$ in $L^p$, $p\geq e(H)$, denoted by $t_H(W)$. One may then define …
-
Extremal and Structural Graph Theory (2019 KMS Annual Meeting)
Room 426, Hong-Mun Hall, Hongik University, SeoulFocus Session @ 2019 KMS Annual MeetingA focus session "Extremal and Structural Graph Theory" at the 2019 KMS Annual Meeting is organized by Sang-il Oum. URL: http://www.kms.or.kr/meetings/fall2019/SpeakersIlkyoo Choi (최일규), Hankuk University of …
-
Pascal Gollin, A Cantor-Bernstein-type theorem for spanning trees in infinite graphs
Room B232 IBS (기초과학연구원)Given a cardinal $\lambda$, a $\lambda$-packing of a graph $G$ is a family of $\lambda$ many edge-disjoint spanning trees of $G$, and a $\lambda$-covering of $G$ is a family of spanning …
-
The 2nd East Asia Workshop on Extremal and Structural Graph Theory
UTOP UBLESS Hotel, Jeju, Korea (유탑유블레스호텔제주)The 2nd East Asia Workshop on Extremal and Structural Graph Theory is a workshop to bring active researchers in the field of extremal and structural graph theory, especially in the …
-
-
Sun Kim (김선), Two identities in Ramanujan’s Lost Notebook with Bessel function series
Room 1401, Bldg. E6-1, KAISTOn page 335 in his lost notebook, Ramanujan recorded without proofs two identities involving finite trigonometric sums and doubly infinite series of Bessel functions. We proved each of these identities …
-
Combinatorial and Discrete Optimization (2019 KSIAM Annual Meeting)
Venezia Hotel & Resort Yeosu, Yeosu, Korea (여수 베네치아 호텔)Special Session @ 2019 KSIAM Annual MeetingA special session on "Combinatorial and Discrete Optimization" at the 2019 KSIAM Annual Meeting is organized by Dabeen Lee. URL: https://www.ksiam.org/conference/84840fb6-87b0-4566-acc1-4802bde58fbd/welcomeDateNov 8, 2019 – Nov …
-
Tony Huynh, Stable sets in graphs with bounded odd cycle packing number
Room B232 IBS (기초과학연구원)It is a classic result that the maximum weight stable set problem is efficiently solvable for bipartite graphs. The recent bimodular algorithm of Artmann, Weismantel and Zenklusen shows that it …
-
Ruth Luo, Induced Turán problems for hypergraphs
Room B232 IBS (기초과학연구원)Let $F$ be a graph. We say that a hypergraph $\mathcal H$ is an induced Berge $F$ if there exists a bijective mapping $f$ from the edges of $F$ to the …
-
Frédéric Meunier, Topological bounds for graph representations over any field
Room B232 IBS (기초과학연구원)Haviv (European Journal of Combinatorics, 2019) has recently proved that some topological lower bounds on the chromatic number of graphs are also lower bounds on their orthogonality dimension over $\mathbb …