Alan Lew, Representability and boxicity of simplicial complexes
An interval graph is the intersection graph of a family of intervals in the real line. Motivated by problems in ecology, Roberts defined the boxicity of a graph G to …
10 events found.
Seminars and Colloquiums
Events
-
-
Zoom ID: 869 4632 6610 (ibsdimag)
-
Hongseok Yang (양홍석), DAG-symmetries and Symmetry-Preserving Neural Networks
Room B232 IBS (기초과학연구원)The preservation of symmetry is one of the key tools for designing data-efficient neural networks. A representative example is convolutional neural networks (CNNs); they preserve translation symmetries, and this symmetry …
-
Jeong Ok Choi (최정옥), Invertibility of circulant matrices of arbitrary size
Room B232 IBS (기초과학연구원)In this talk, we present sufficient conditions to guarantee the invertibility of rational circulant matrices with any given size. These sufficient conditions consist of linear combinations in terms of the …
-
Florian Gut and Attila Joó, Large vertex-flames in uncountable digraphs
Zoom ID: 869 4632 6610 (ibsdimag)The local connectivity $ \kappa_D(r,v) $ from $ r $ to $ v $ is defined to be the maximal number of internally disjoint $r\rightarrow v $ paths in $ …
-
-
Suil O (오수일), Eigenvalues and [a, b]-factors in regular graphs
Room B232 IBS (기초과학연구원)For positive integers, $r \ge 3, h \ge 1,$ and $k \ge 1$, Bollobás, Saito, and Wormald proved some sufficient conditions for an $h$-edge-connected $r$-regular graph to have a k-factor …
-
Jaehoon Kim (김재훈), $K_{r+1}$-saturated graphs with small spectral radius
Room B232 IBS (기초과학연구원)For a graph $H$, a graph $G$ is $H$-saturated if $G$ does not contain $H$ as a subgraph but for any $e\in E(\overline G)$, $G+e$ contains $H$. In this note, we prove …
-
Stefan Weltge, Integer programs with bounded subdeterminants and two nonzeros per row
Room B232 IBS (기초과학연구원)We give a strongly polynomial-time algorithm for integer linear programs defined by integer coefficient matrices whose subdeterminants are bounded by a constant and that contain at most two nonzero entries …
-
Semin Yoo (유세민), Combinatorics of Euclidean spaces over finite fields
Room B232 IBS (기초과학연구원)$q$-analogues of quantities in mathematics involve perturbations of classical quantities using the parameter $q$, and revert to the original quantities when $q$ goes $1$. An important example is the $q$-analogues …
-
Euiwoong Lee (이의웅), The Karger-Stein algorithm is optimal for k-cut
Room B232 IBS (기초과학연구원)In the k-cut problem, we are given an edge-weighted graph and want to find the least-weight set of edges whose deletion breaks the graph into k connected components. It is …
-
Maria Chudnovsky, Induced subgraphs and tree decompositions
Zoom ID: 869 4632 6610 (ibsdimag)Tree decompositions are a powerful tool in structural graph theory; they are traditionally used in the context of forbidden graph minors. Connecting tree decompositions and forbidden induced subgraphs has until …