DSpace Community: KAIST College of Natural Sciences
http://hdl.handle.net/10203/11
KAIST College of Natural Sciences2020-12-20T11:57:20Zl-adic étale cohomology of Shimura varieties of Hodge type with non-trivial coefficients
http://hdl.handle.net/10203/251897
Title: l-adic étale cohomology of Shimura varieties of Hodge type with non-trivial coefficients
Authors: Hamacher, Paul; Kim, WansuDevelopment of small molecules as therapeutic candidates targeting multiple pathological factors in Alzheimer’s disease
http://hdl.handle.net/10203/273484
Title: Development of small molecules as therapeutic candidates targeting multiple pathological factors in Alzheimer’s disease
Authors: 임미희2020-12-12T00:00:00ZThe average cut-rank of graphs
http://hdl.handle.net/10203/276403
Title: The average cut-rank of graphs
Authors: Nguyen, Huy-Tung; Oum, Sang-il
Abstract: The cut-rank of a set X of vertices in a graph G is defined as the rank of the X x (V(G) \ X) matrix over the binary field whose (i, j)-entry is 1 if the vertex i in X is adjacent to the vertex j in V(G)\X and 0 otherwise. We introduce the graph parameter called the average cut-rank of a graph, defined as the expected value of the cut-rank of a random set of vertices. We show that this parameter does not increase when taking vertex-minors of graphs and a class of graphs has bounded average cut-rank if and only if it has bounded neighborhood diversity. This allows us to deduce that for each real alpha, the list of induced-subgraphminimal graphs having average cut-rank larger than (or at least) alpha is finite. We further refine this by providing an upper bound on the size of obstruction and a lower bound on the number of obstructions for average cut-rank at most (or smaller than) alpha for each real alpha >= 0. Finally, we describe explicitly all graphs of average cut-rank at most 3/2 and determine up to 3/2 all possible values that can be realized as the average cut-rank of some graph.2020-12-01T00:00:00ZBranch-depth: Generalizing tree-depth of graphs
http://hdl.handle.net/10203/276402
Title: Branch-depth: Generalizing tree-depth of graphs
Authors: DeVos, Matt; Kwon, O-joung; Oum, Sang-il
Abstract: We present a concept called the branch-depth of a connectivity function, that generalizes the tree-depth of graphs. Then we prove two theorems showing that this concept aligns closely with the notions of tree-depth and shrub-depth of graphs as follows. For a graph G = (V, E) and a subset A of E we let lambda(G)(A) be the number of vertices incident with an edge in A and an edge in E \ A. For a subset X of V, let rho(G)(X) be the rank of the adjacency matrix between X and V \ X over the binary field. We prove that a class of graphs has bounded tree-depth if and only if the corresponding class of functions lambda(G) has bounded branch depth and similarly a class of graphs has bounded shrub-depth if and only if the corresponding class of functions rho(G) has bounded branch-depth, which we call the rank-depth of graphs. Furthermore we investigate various potential generalizations of tree-depth to matroids and prove that matroids representable over a fixed finite field having no large circuits are well-quasi ordered by restriction.2020-12-01T00:00:00Z