Pascal Gollin, A Cantor-Bernstein-type theorem for spanning trees in infinite graphs
Room B232 IBS (기초과학연구원)Given a cardinal
10 events found.
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 East Asia such as China, Japan, and Korea.DateOct 31, 2019 (Arrival Day) - Nov 4, 2019 (Departure Day)Venue and Date1st floor Diamond HallUTOP UBLESS Hotel, …
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 under three different interpretations for the double series, and showed that they are intimately connected with the classical circle and divisor problems in number theory. …
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 9, 2019 Address: 61-13 Odongdo-ro, Sujeong-dong, Yeosu-si, Jeollanam-do (전남 여수시 오동도로 61-13)VenueVenezia Hotel & Resort Yeosu, Yeosu, Korea (여수 베네치아 호텔) Address: 61-13 Odongdo-ro, Sujeong-dong, …
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 is also efficiently solvable for graphs without two disjoint odd cycles. The complexity of the stable set problem for graphs without
Ruth Luo, Induced Turán problems for hypergraphs
Room B232 IBS (기초과학연구원)Let
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
Jakub Gajarský, First-order interpretations of bounded expansion classes
Room B232 IBS (기초과학연구원)The notion of bounded expansion captures uniform sparsity of graph classes and renders various algorithmic problems that are hard in general tractable. In particular, the model-checking problem for first-order logic is fixed-parameter tractable over such graph classes. With the aim of generalizing such results to dense graphs, we introduce classes of graphs with structurally bounded expansion, defined as first-order interpretations of …
Hong Liu, A proof of Mader’s conjecture on large clique subdivisions in
Room 1401, Bldg. E6-1, KAIST
Given any integers
Attila Joó, Base partition for finitary-cofinitary matroid families
Room B232 IBS (기초과학연구원)Let