ASIACOMB 2026

The program grid below provides an overview of the schedule for each day of the conference.
Note that this is a preliminary version and may be subject to changes. Please check back for updates as the conference date approaches.

Sunday (8/23)

Time Room A Room B Room C Room D Room E Room F
15:00-18:00 Registration DCC

Monday (8/24)

Time Room A Room B Room C Room D Room E Room F
08:30-09:15 Registration DCC
09:15-09:30 Opening Remarks
09:30-10:30 Plenary Talk Mihyun Kang Title: Phase transitions in random graphs on surfaces Location: DCC 2nd floor
10:30-11:00 Coffee Break
11:00-11:30 Yi-Hau KaoProving Guo's Conjecture on Richardson Tableaux Yijia FangCanonical Ramsey Property for All Triangles Nikolai KarolStructure of k-Matching-Planar Graphs Myungho Choi2-limited broadcast domination in cubic graphs Tomoki TamaruMore on the Corner-Vector Construction for Spherical Designs Jaehyeon SeoDegree-sequence bounds for independent sets via multivariate local occupancy
11:30-12:00 Mike CummingsWebs and Smooth Components of Two Column Springer Fibers Matías Azócar CarvajalCanonical Ramsey theorem for graphs with clean intersections Rongxing XuPartitioning triangle-free planar graphs into a forest and a linear forest Sonwabile MafundaOn the conjecture of Beineke and Henning on independent distance dominating sets Yifan JingSharp quantitative stability in Hilbert spaces Fan ChangFunctional Inequalities and Random Walks on Increasing Subsets of the Hypercube
12:00-14:30 Lunch Break
14:30-15:30 Plenary Talk Anton Bernshteyn Title: Matchings and the Banach--Tarski Paradox Location: DCC 2nd floor
15:30-16:00 Coffee Break
16:00-16:30 Masato KobayashiA quite simple formula on Bruhat order and bigrassmannian permutations Lin-Peng ZhangPerfect tilings with the generalised triangle in k-graphs Yoshimi EgawaGeneration theorem for 5-connected graphs Yakov ShubinOn supersaturation in the Erdős-Sós Problem Arsenii SagdeevGraphs in Euclidean Ramsey Theory Ningyuan YangChromatic thresholds for linear equations and recurrence
16:30-17:00 Eunjeong LeeIntersections of Schubert varieties and smooth T-stable subvarieties of flag varieties Nicolás Sanhueza MatamalaOptimal and efficient partite decompositions of hypergraphs Lili HaoThe existence of 2-factors in $3/2$-tough maximial planar graphs Ligang JinColoring of generalized signed graphs and its application to DP coloring Laurentiu PloscaruMany Antipodal Pairs Force many Neighboring Pairs Semin YooMultiplicative irreducibility of shifted multiplicative subgroups
17:00-17:30 Yibo GaoBilley--Postnikov posets, rationally smooth Schubert varieties, and Poincaré duality Arjun RanganathanExact minimum co-degree bounds for tight Hamilton cycles Xiang ChenA constructive characterization of uniformly 4-connected graphs Xiaowei Yu(Fractional) balanced coloring of signed graphs Maxim KlimenkoCovering integer points of a cross-polytope by subspaces Guo-Dong HongSimultaneous popular polynomial Szemerédi theorem over finite fields
18:00 onward Reception IBS Science Culture Center, 3rd floor

Tuesday (8/25)

Time Room A Room B Room C Room D Room E Room F
09:00-10:00 Plenary Talk Van Vu Title: New Matrix Perturbation Bounds via Relative Norm Location: DCC 2nd floor
10:00-10:30 Yulin PengCoxeter Condorcet domains and Condorcet root posets Jing WangSpectral Turán Problems for Expansion Hypergraphs Alexander ClowSmall Quasi-Kernel in Digraphs with Bounded Out-Degree Chenglong DengList colouring of toroidal grids Jie WangLower bound theorems on the numbers of faces of polytopes with at most $3d-1$ vertices Alexander GavrilyukIntersecting families of spanning trees in complete bipartite graphs
10:30-11:00 Coffee Break
11:00-11:30 Hanlin XuMacNeille completions of parabolic quotients in the symmetric group Zion HeftyImproving $R(3,k)$ in just two bites Seokbeom KimThe structure of $\Delta(1, 2, 2)$-free tournaments Zihui XuBetween proper and square colorings of planar graphs with maximum degree at most four David YostDecomposability of polyhedra and their graphs Hyunwoo LeeAnticoncentration of random spanning trees in almost regular graphs
11:30-12:00 Gaston BurrullOn the Classification of Isomorphisms between Affine Bruhat Intervals Wenling ZhouSome exact values of the uniform Turán densities Bartlomiej KielakDigraphs with density maximized by transitive tournaments Xiaolan HuPlanar graphs of odd girth 7 are fractional $14/5$-colorable Mangaldeep SahaNormal 4-pseudomanifolds with a relative 2-skeleton Yetong ShaSpanning trees of bounded degree in random geometric graphs
12:00-14:30 Lunch Break
14:30-15:30 Plenary Talk Joshua Zahl Title: (Discretized) incidence geometry, harmonic analysis, and geometric measure theory Location: DCC 2nd floor
15:30-16:00 Coffee Break
16:00-16:30 Kai ZhangThe lattices $m \times 2$ and $m \times 3$ are not Schur positive Dylan KingRelative Ordered Turán Densities Hikaru YokoiSelf-duality of pathwidth for polyhedral embeddings Cyril PujolWinding number and circular coloring Ferdinand IhringerLocal arcs, locally repairable codes, large matchings Eduard InozemtsevFrankl's diversity theorem for permutations
16:30-17:00 Hojoon LeePositivity Phenomena in Koornwinder Moments for the 2-ASEP Henry LiuOn degree powers in the degenerate Turán problem On-Hei Solomon LoA characterization of graphs with no $K_{3,4}$-minor Yiting JiangIndicated List Coloring Game On Graphs Ananth RaviThe chromatic number of finite projective spaces Elizaveta IarovikovaA complete t-intersection theorem for families of spanning trees
17:00-17:30 Cordelia Yuqiao LiHomomesy on stable set polytopes of paths Fan YangExtremal density for subdivisions with length or sparsity constraints Shinya FujitaFrom Halin's Edge Removability to Matching Removability in k-connected graphs Naoki MatsumotoCubic graphs with game chromatic number 3 Lukas KlawuhnDesigns of Perfect Matchings Andrey KupavskiiIntersection theorems in spread domains

Wednesday (8/26)

Time Room A Room B Room C Room D Room E Room F
09:00-10:00 Plenary Talk Alexander Postnikov Title: Honeycombs, plabic graphs, and polypositroids Location: DCC 2nd floor
10:00-10:30 Liu XinbeiLascoux's series, parking functions and noncrossing partitions ZhiFei YanMonochromatic matchings in hypergraphs Taehee Hongp-competitively orientable graphs Eckhard SteffenEdge-coloring 4- and 5-regular projective planar graphs with no Petersen-minor Haofang SunCurvilinear Tilings and Hurwitz Problem Yeonsu ChangAlgorithmic Applications of Reduced Component Max-Leaf
10:30-11:00 Coffee Break
11:00-11:30 Michael Ruofan ZengThe $K_0$-Ring of Spanning Line Configurations, Fubini Words, and Rectangular Pipe Dreams Minghui YuBerge tight cycles of all lengths in hypergraphs Chaoliang TangAn Improved Bound of Stein's Conjecture for Antidirected Paths Jialu ZhuDegree-truncated choice number of planar graphs Shohei KoizumiSpanning triangulations in plane X-mosaics Reymond AkpanyaRegular Graphs with given Automorphism Groups
11:30-12:00 Minho SongDeograms and their links to rational Catalan objects Yulin YangAn Erdős matching conjecture for vector spaces Alexander CliftonLocally Irregular Graph Covering Kenta OzekiOdd edge colorings of graphs with high connectivity Dohyeon LeeHelly-type Theorems for Multiple Piercing Colin GenietBasis Number of Graphs Excluding Minors
12:00-14:30 Lunch Break
14:30-15:30 Plenary Talk Jaehoon Kim Title: Local Conditions for Global Structures in Graphs Location: DCC 2nd floor
15:30-15:40 10 min Break
15:40-16:10 Prize Ceremony Location: DCC 2nd floor
16:10-17:10 Prize Winner Talk Name: TBA Title: TBA Location: DCC 2nd floor
17:10-18:00 Break
18:00 onward Banquet

Thursday (8/27)

Time Room A Room B Room C Room D Room E Room F
09:00-10:00 Plenary Talk Allen Knutson Title: TBA Location: DCC 2nd floor
10:00-10:30 Sen-Peng EuOn Ternary Trees and Fighting Fish Chenyang ZhangSharp bounds for uniform union-free hypergraphs Masahiro SankaHamiltonicity of $P_2 \cup kP_1$-free graphs with many vertices Xujun LiuBetween proper and square colorings of sparse graphs Shohei SatakeOn spectrally indistinguishable pseudorandom graphs Attila SaliMore Shattering News
10:30-11:00 Coffee Break
11:00-11:30 Shen-Fu TsaiOn pattern-avoiding hypermatrices and higher-dimensional partitions Dilong YangRelative discrepancy of hypergraphs Leilei ZhangHamiltonian Properties of 3-Connected Claw-Free Graphs and Line Graphs of 3-Hypergraphs Qiancheng OuyangNew bounds for proper h-conflict-free colourings Wanting SunClique factors in random samplings of regular graphs Toby InsleySparse Partitions of Graphs with Bounded Clique Number
11:30-12:00 Tamás TakácsPrefix-bounded matrices Jing YuHypergraph independence bounds: from maximum degree to average degree Kengo EnamiInduced outerplanar subgraphs in planar graphs Yumiko OhnoThe achromatic number and the pseudoachromatic number of caterpillars Yaobin ChenNote on the trace of random walks on pseudorandom graphs Pawel PralatTop Trading Cycles with Random Preferences
12:00-14:30 Lunch Break
14:30-15:30 Plenary Talk Bojan Mohar Title: Back to the basics --- The Four-Color Theorem and its generalizations Location: DCC 2nd floor
15:30-16:00 Coffee Break
16:00-16:30 Péter Pál PachOn the density of Kravitz sets Guanghui WangErdős-Rogers function on hypergraphs Mujin ChoiOdd-Cycle-Packing-treewidth and Grid Theorem for odd-minor relation Yian XuPolynomial chi-boundedness of graphs forbidding specific forests Alexander NatalchenkoAnti-Ramsey Numbers of Expansions of Graphs Zhenyu LiA step toward Chen-Lih-Wu conjecture
16:30-17:00 Jiali DuOn m-partite (di)graphical semiregular representation of finite groups Dingyuan LiuTurán problems for simplicial complexes Jungho AhnUnavoidable pivot-minors in graphs of large rank-depth Yisai XueOn the chromatic profile for tripartite graphs and beyond Miklos RuszinkoMonochromatic paths and components Santhosh Raghul$\theta$-free graphs: characterization and consequences
17:00-17:30 Jaeseong OhShuffle theorem for torus link homology Laihao DingVanishing orders and zero degree Turán densities Jacob StegemannA duality theorem for infinite tree-width Yangyan GuOnline list version of Hadwiger's conjecture Georgy SokolovOn the Erdős-Kleitman problem Ryota MasubaraOn bipartite holes and k-leaf-connectedness

Friday (8/28)

Time Room A Room B Room C Room D Room E Room F
09:00-10:00 Plenary Talk Jie Han Title: Random sparsification of graphs Location: DCC 2nd floor
10:00-10:30 Mikhail BludovOn the Homotopy Type of Unbalanced Subset Complexes Guorong GaoAlmost regular subgraphs under spectral radius constraints Masaki KashimaNew conditions ensuring specified factors of graphs Jung Hon YipHadwiger's Conjecture for $\{co-claw,co-gem\}$-free graphs and $\{fork,antifork\}$-free graphs Gang YangBoolean lattice without small rainbow subposets Shiqi CaoDowling's polynomial conjecture for independent sets of matroids
10:30-11:00 Coffee Break
11:00-11:30 Daniel McGinnisMulti-extremal Betti numbers Jialin HeOn the Number of Triangles in $K_4$-Free Graphs Koshin YoshidaPartitions of a bipartite graph into cycles containing specified paths Jan OubornyAll graphs are majority 3-choosable Hideki MatsumuraEllipsoidal designs and the Prouhet--Tarry--Escott problem Junchi ZhangSubmodular flows on measurable spaces
11:30-12:00 Maryam Mohammadi YektaA lower bound for the coefficients of denormalized Lorentzian Laurent series and applications Donglei YangPacking 4-cliques in edge-weighted graphs Takahiro UeoroOn graphs without cycles of length $0 \bmod 3$ or $4 \bmod 6$ Luis KuffnerHomomorphism bounds for $(K_4,-)$-minor-free signed graphs of negative girth $k$ Nikolai TerekhovOn the problem of Füredi concerning $(k, L)$-systems Yoshio SanoOn matching preclusion sets in weighted graphs
12:00-14:30 Lunch Break
14:30-15:00 Donghyun KimExploring the science fiction Yuefang SunOn oriented Turán problems Ravindra PawarMatching Minors: a sequel to the results of Lovász and Plummer O-joung KwonInduced-packing variants of the Erdős-Posa theorem Ingyu BaekImproved bounds for loose odd cycle densities Shunichi MaezawaOn Reconfiguration Graphs Induced by Rainbow Spanning Trees
15:00-15:30 Warut ThawinrakCounting lattice points in generalized permutohedra from A to B Ni Luh Dewi SintiariA Positive Instance of Scott's Conjecture on Induced Subdivisions Márk Hunor JuhászMatching Problems in Temporal Graphs Sarah HoudaigouiA quasi-polynomial bound for the minimal excluded minors for a surface Xinqi HuangAccumulation Points of Homomorphism Thresholds Florian LehnerThree Cops Win on the Torus (even if only two can move at a time)