Doowon Koh (고두원), Mattila-Sjölin type functions: A finite field model
Room B232 IBS (기초과학연구원)Let
10 events found.
Discrete Math Seminar
O-joung Kwon (권오정), Classes of intersection digraphs with good algorithmic properties
Zoom ID: 875 9395 3555 (relay) [CLOSED]An intersection digraph is a digraph where every vertex
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 …
Suil O (오수일), Eigenvalues and [a, b]-factors in regular graphs
Room B232 IBS (기초과학연구원)For positive integers,
Jaehoon Kim (김재훈),
Room B232
IBS (기초과학연구원)
For a graph
Semin Yoo (유세민), Combinatorics of Euclidean spaces over finite fields
Room B232 IBS (기초과학연구원)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 …
Duksang Lee (이덕상), Intertwining connectivities for vertex-minors and pivot-minors
Room B232 IBS (기초과학연구원)We show that for pairs (Q,R) and (S,T) of disjoint subsets of vertices of a graph G, if G is sufficiently large, then there exists a vertex v in V(G)−(Q∪R∪S∪T) such …
Linda Cook, Two results on graphs with holes of restricted lengths
Room B232 IBS (기초과학연구원)We call an induced cycle of length at least four a hole. The parity of a hole is the parity of its length. Forbidding holes of certain types in a graph …