On-Hei Solomon Lo, Minors of non-hamiltonian graphs
A seminal result of Tutte asserts that every 4-connected planar graph is hamiltonian. By Wagner's theorem, Tutte's result can be restated as: every 4-connected graph with no $K_{3,3}$ minor is …
10 events found.
Discrete Math Seminar
Events
-
-
Room B332 IBS (기초과학연구원)
-
Attila Jung, The Quantitative Fractional Helly Theorem
Room B332 IBS (기초과학연구원)Two celebrated extensions of Helly's theorem are the Fractional Helly theorem of Katchalski and Liu (1979) and the Quantitative Volume theorem of Barany, Katchalski, and Pach (1982). Improving on several …
-
Roohani Sharma, Uniform and Constructive Polynomial Kernel for Deletion to $K_{2,p}$ Minor-Free Graphs
Room B332 IBS (기초과학연구원)Let $\mathcal F$ be a fixed, finite family of graphs. In the $\mathcal F$-Deletion problem, the input is a graph G and a positive integer k, and the goal is …
-
-
Sergey Norin, Asymptotic dimension of intersection graphs
Room B332 IBS (기초과학연구원)The notion of asymptotic dimension of metric spaces, introduced by Gromov, describes their large-scale behaviour. Asymptotic dimension of graph families has been recently studied, in particular, by Bonamy et al. …
-
Mihyun Kang (강미현), Phase transitions in a random subgraph of the hypercube
Room B332 IBS (기초과학연구원)We will discuss classical and recent results about phase transitions in random subgraphs of the hypercube and beyond. The focus will be on the giant component, long cycles, large matchings, …
-
Linda Cook, A tight algorithmic meta-theorem for distributed certification within bounded treewidth graphs
Room B332 IBS (기초과학연구원)A local certification of a graph property is a protocol in which nodes are given “certificates of a graph property” that allow the nodes to check whether their network has this …
-
Colin Geniet, Merge-width
Room B332 IBS (기초과학연구원)This talk is an introduction to the recent notion of merge-width, proposed by Jan Dreier and Szymon Torúnczyk. I will give an overview of the context and motivations for merge-width, …
-
-
Tony Huynh, Rainbow triangles and the Erdős-Hajnal problem in projective geometries
Room B332 IBS (기초과학연구원)We formulate a geometric version of the Erdős-Hajnal conjecture that applies to finite projective geometries rather than graphs. In fact, we give a natural extension of the 'multicoloured' version of …
-
Chien-Chung Huang, Robust Sparsification for Matroid Intersection with Applications
Room B332 IBS (기초과학연구원)The matroid intersection problem is a fundamental problem in combinatorial optimization. In this problem we are given two matroids and the goal is to find the largest common independent set …
-
Sang-il Oum (엄상일), The Erdős-Pósa property for circle graphs as vertex-minors
Room B332 IBS (기초과학연구원)We prove that for any circle graph $H$ with at least one edge and for any positive integer $k$, there exists an integer $t=t(k,H)$ so that every graph $G$ either …