Text only print
Full screen print
Tuesday Seminar on Topology
Seminar information archive ～04/18｜Next seminar｜Future seminars 04/19～
| Date, time & place | Tuesday 17:00 - 18:30 056Room #056 (Graduate School of Math. Sci. Bldg.) |
|---|---|
| Organizer(s) | KAWAZUMI Nariya, KITAYAMA Takahiro, SAKASAI Takuya |
2021/06/08
17:00-18:00 Online
Pre-registration required. See our seminar webpage.
Takahiro Matsusita (University of the Ryukyus)
Graphs whose Kronecker coverings are bipartite Kneser graphs (JAPANESE)
https://park.itc.u-tokyo.ac.jp/MSF/topology/TuesdaySeminar/index_e.html
Pre-registration required. See our seminar webpage.
Takahiro Matsusita (University of the Ryukyus)
Graphs whose Kronecker coverings are bipartite Kneser graphs (JAPANESE)
[ Abstract ]
Kronecker coverings are bipartite double coverings of graphs which are canonically determined. If a graph G is non-bipartite and connected, then there is a unique bipartite double covering of G, and the Kronecker covering of G coincides with it.
In general, there are non-isomorphic graphs although they have the same Kronecker coverings. Therefore, for a given bipartite graph X, it is a natural problem to classify the graphs whose Kronecker coverings are isomorphic to X. Such a classification problem was actually suggested by Imrich and Pisanski, and has been settled in some cases.
In this lecture, we classify the graphs whose Kronecker coverings are bipartite Kneser graphs H(n, k). The Kneser graph K(n, k) is the graph whose vertex set is the family of k-subsets of the n-point set {1, …, n}, and two vertices are adjacent if and only if they are disjoint. The bipartite Kneser graph H(n, k) is the Kronecker covering of K(n, k). We show that there are exactly k graphs whose Kronecker coverings are H(n, k) when n is greater than 2k. Moreover, we determine their automorphism groups and chromatic numbers.
[ Reference URL ]Kronecker coverings are bipartite double coverings of graphs which are canonically determined. If a graph G is non-bipartite and connected, then there is a unique bipartite double covering of G, and the Kronecker covering of G coincides with it.
In general, there are non-isomorphic graphs although they have the same Kronecker coverings. Therefore, for a given bipartite graph X, it is a natural problem to classify the graphs whose Kronecker coverings are isomorphic to X. Such a classification problem was actually suggested by Imrich and Pisanski, and has been settled in some cases.
In this lecture, we classify the graphs whose Kronecker coverings are bipartite Kneser graphs H(n, k). The Kneser graph K(n, k) is the graph whose vertex set is the family of k-subsets of the n-point set {1, …, n}, and two vertices are adjacent if and only if they are disjoint. The bipartite Kneser graph H(n, k) is the Kronecker covering of K(n, k). We show that there are exactly k graphs whose Kronecker coverings are H(n, k) when n is greater than 2k. Moreover, we determine their automorphism groups and chromatic numbers.
https://park.itc.u-tokyo.ac.jp/MSF/topology/TuesdaySeminar/index_e.html
