2018 International Conference on Graph Theory,

Combinatorics and Applications

Zhejiang Normal University, 688 Yingbin Road, Jinhua, Zhejiang Province, China

October 27-28, 2018

Oct. 27 (地点：数理与信息工程学院第一报告厅)

Chairman: Douglas West

8:30-9:30 Speaker:

Jaroslav Nešetřil

Zhejiang Normal University, China

Charles University, Czech

Title: Graphs and orderings

9:30-10:30 Speaker:

Genghua Fan

Fuzhou University, China

Title: Flows and circuit covers in signed graphs

10:30-11:00 Photo and Tea Break

Chairman: Zhiquan Hu

11:00-11:30

Speaker: Yuejian Peng

Hunan University, China

Title: 3-colored asymmetric bipartite Ramsey number of

connected matchings and cycles

11:30-12:00 Speaker:

Rong Chen

Fuzhou University, China

Title: Three classes of matroids associated with graphs

12:00-13:30 Lunch

Chairman: Jie Ma

13:30-14:30 Speaker:

Baogang Xu

Nanjing Normal University, China

Title: Some results on chromatic number and forbidden holes

Chairman: Rongxia Hao

14:30-15:00 Speaker:

Uwe Schauz

Xi’an Jiaotong-Liverpool University, China

Title: Computing the list chromatic index of graphs

15:00-15:30

Speaker: Xinmin Hou

University of Science and Technology of China, China

Title: On perfect matching coverings and even subgraph

coverings

15:30-16:00 Tea Break

Chairman: Qizhong Lin

16:00-16:30 Speaker:

Xin Zhang

Xidian University, China

Title: Equitable vertex arboricity of graphs

16:30-17:00 Speaker:

Xing Peng

Tianjin University, China

Title: An extension of Erdős-Gallai theorem with applications

Oct. 28 (地点：数理与信息工程学院第一报告厅)

Chairman: Weifan Wang

8:30-9:30 Speaker:

Gennian Ge

Capital Normal University, China

Title: Sparse hypergraphs: from theory to application

9:30-10:30

Speaker: Jan Kratochvil

Charles University, Czech

Title: Geometric intersection graphs: from interval graphs to

string graphs

10:30-11:00 Tea Break

Chairman: Min Chen

11:00-11:30 Speaker:

Seog-Jin Kim

Konkuk University, Korea

Title: Signed colouring and list colouring of k-chromatic graphs

11:30-12:00 Speaker:

Tao Wang

Henan University, China

Title: Cover and variable degeneracy

12:00-13:30 Lunch

Chairman: Daqing Yang

13:30-14:30 Speaker:

Jarosław Grytczuk

Warsaw University of Technology, Poland

Title: From 1-2-3 conjecture to Riemann Hypothesis

Chairman: Huajun Zhang

14:30-15:00

Speaker: Young Soo Kwon

Yeungnam University, Korea

Title: t-common list colorings and some variations of list

colorings

15:00-15:30

Speaker: Yian Xu

The University of Western Australia, Australia

Title: Normal and non-normal Cayley graphs for isomorphic

regular groups

15:30-16:00 Tea Break

Chairman: Huifang Yan

16:00-16:30 Speaker:

Yezhou Wu

Zhejiang University, China

Title: Shortest circuit covers of signed graphs

16:30-17:00 Speaker:

Suijie Wang

Hunan University, China

Title: Linear bounds on characteristic polynomials of matroids

Contents

Plenary Talks

Genghua Fan, Flows and circuit covers in signed graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1

Gennian Ge, Sparse hypergraphs: from theory to application . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1

Jaros law Grytczuk, From 1-2-3 conjecture to Riemann Hypothesis . . . . . . . . . . . . . . . . . . . . . . 2

Jan Kratochvil, Geometric intersection graphs: from interval graphs to string graphs . . 2

Jaroslav Nesetril, Graphs and orderings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .3

Baogang Xu, Some results on chromatic number and forbidden holes . . . . . . . . . . . . . . . . . . . . 3

Invited Talks

Rong Chen, Three classes of matroids associated with graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . .4

Xinmin Hou, On perfect matching coverings and even subgraph coverings . . . . . . . . . . . . . . . 4

Seog-Jin Kim, Signed colouring and list colouring of k-chromatic graphs . . . . . . . . . . . . . . . . . 5

Young Soo Kwon, t-common list colorings and some variations of list colorings . . . . . . . . . 5

Xing Peng, An extension of Erdos-Gallai theorem with applications . . . . . . . . . . . . . . . . . . . . . 6

Yuejian Peng, 3-colored asymmetric bipartite Ramsey number of connected matchings

and cycles . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6

Uwe Schauz, Computing the list chromatic index of graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7

Suijie Wang, Linear bounds on characteristic polynomials of matroids . . . . . . . . . . . . . . . . . . . 7

Tao Wang, Cover and variable degeneracy . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8

Yezhou Wu, Shortest circuit covers of signed graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8

Yian Xu, Normal and non-normal Cayley graphs for isomorphic regular groups . . . . . . . . . 9

Xin Zhang, Equitable vertex arboricity of graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9

Plenary Talks

Flows and circuit covers in signed graphs

Genghua Fan

Fuzhou University, China

Abstract

A signed graph G is a graph associated with a mapping σ: E(G) → {+1,−1}. Signedgraphs can be used to present surface duals of digraphs embedded in non-orientable sur-faces. A signed graph is coverable if each edge is contained in some signed circuit. Theedges of a signed circuit in a signed graph corresponds a minimal dependent set in thesigned graphic matroid. An oriented signed graph (bidirected graph) has a nowhere-zerointeger flow if and only if it is coverable. A signed circuit cover of G is a collection ofsigned circuits which covers all the edges of G. Signed circuit covers is a new topic drawingattention in recent years. In this talk, we give a brief survey of known results and openproblems on signed circuit covers of signed graphs.

Sparse hypergraphs: from theory to application

Gennian Ge

Capital Normal University, China

Abstract

More than forty years ago, Brown, Erdos and Sos introduced the function fr(n, v, e)to denote the maximum number of edges in an r-uniform hypergraph on n vertices whichdoes not contain e edges spanned by v vertices. They posed a well-known conjecture:nk−o(1) < fr(n, e(r − k) + k + 1, e) = o(nk) holds for all integers r > k ≥ 2, e ≥ 3. Notethat for r = 3, e = 3, k = 2, this conjecture was solved by the famous Ruzsa-Szemeredi’s(6,3)-theorem. We add more evidence for the validity of this conjecture. On one hand,we use the hypergraph removal lemma to prove that the upper bound is true for all fixedintegers r ≥ k+ 1 ≥ e ≥ 3. On the other hand, we use tools from additive number theoryto show that the lower bound is true for r ≥ 3, k = 2 and e = 4, 5, 7, 8.

We also use the theory of sparse hypergraphs to attack several open problems andconjectures in cryptography. In particular, we use the (6,3)-theorem to solve a conjectureof Walker and Colbourn on perfect hash families. This conjecture had been open for tenyears and traditional methods seem to have limited effect on it.

1

From 1-2-3 conjecture to Riemann Hypothesis

Jaros law Grytczuk

Warsaw University of Technology, Poland

Abstract

The following, innocently looking question was asked in [1]: Can the edges of anynon-trivial graph be assigned weights from {1, 2, 3} so that adjacent vertices have differentsums of incident edge weights? There exist many variations on this problem in whichone tries to get a graph coloring by other manipulations on vertex degrees. It turns out,unexpectedly, that one of them is related to some deep number theoretic problems, likeGraham’s gcd-problem, Erdos Discrepancy Problem, or even the Riemann Hypothesis.

References

[1] M. Karonski, T. Luczak, and A. Thomason, Edge weights and vertex colours, J Combin

Theory Ser B 91 (2004), 151–157.

Geometric intersection graphs: from interval graphs to string graphs

Jan Kratochvil

Charles University, Czech Republic

Abstract

Intersection representations of graphs are a natural way of graph and network visu-alization. At the same time the classes of graphs that arise in this way are popular andwell studied for their interesting and elegant structural, as well as algorithmic properties.The oldest and best understood of them are interval graphs, i.e., intersection graphs ofintervals on a real line, while the most general are string graphs, i.e., intersection graphsof curves in the plane. A rich universe of intersection defined classes of graphs, describedby geometric properties of the representations lies between these extremal classes.

In the talk, I will survey known results on these classes of graphs, show some of theirelegant properties and proofs and discuss new as well as persisting open problems. Theclasses considered will include but not be restricted to interval, circle, circular arc, func-tion, trapezoid, segment intersection and convex set intersection graphs. The questionsposed will concern recognition, complexity of optimization problems restricted to theseclasses, simultaneous representability and representability of planar graphs.

2

Graphs and orderings

Jaroslav Nesetril

Zhejiang Normal University, China

Charles University, Czech Republic

Abstract

Ordered graph is a graph with linearly ordered vertices. Isomorphisms, subgraphsand homomorphisms should then preserve not only edges but also orderings, i.e. thecorresponding mappings should be monotone.

Which ordered graphs are unavoidable in any ordering of an (unordered) graph? Wesurvey the development of this area which was recently revitalized in yet another context.

Some results on chromatic number and forbidden holes

Baogang Xu

Nanjing Normal University, China

Abstract

A hole is an induced cycle of length at least 4. In this talk, we will present some resultsand open problems on chromatic number and forbidden holes.

3

Invited Talks

Three classes of matroids associated with graphs

Rong Chen

Fuzhou University, China

Abstract

Frame matroids and lifted-graphic matroids are matroids defined using graphs. Theyare two very important classes of matroids, in part due to their prominent role in theMatroid Minor Project. Recently Geelen, Gerards, and Whittle completed the first formalstudy of the class of so-called quasi-graphic matroids, which describes a spectrum ofmatroids contained between frame matroids and lifted-graphic matroids. The three classesof matroids are minor-closed, each of which generalises the class of graphic matroids andexhibits clear graph structure. In this talk, I will introduce some recent results, problems,and conjectures related to the three classes of matroids. No background on matroid theoryis required for the audience.

On perfect matching coverings and even subgraph coverings

Xinmin Hou

University of Science and Technology of China, China

Abstract

A perfect matching covering of a graph G is a set of perfect matchings of G such thatevery edge of G is contained in at least one member of it. Berge conjectured that everybridgeless cubic graph admits a perfect matching covering of order at most five (we callsuch a collection of perfect matchings a Berge covering of G). A cubic graph G is called aKotzig graph if G has a 3-edge-coloring such that each pair of colors form a hamiltoniancircuit (introduced by Haggkvist and Markstrom, JCTB 2006). In this talk, we prove thatif there is a vertex w of a cubic graph G such that G− w, the graph obtained from G−wby suppressing all degree two vertices, is a Kotzig graph, then G has a Berge covering. Wealso obtain some results concerning the so-called 5-even subgraph double cover conjecture.(Joint work with Hong-Jian Lai and Cun-Quan Zhang)

4

Signed colouring and list colouring of k-chromatic graphs

Seog-Jin Kim

Konkuk University, Korea

Abstract

A signed graph is a pair (G, σ), where G is a graph and σ : E(G) → {1,−1} is asignature of G. A set S of integers is symmetric if i ∈ S implies that −i ∈ S. Ak-colouring of (G, σ) is a mapping f : V (G) → Nk such that for each edge e = uv,f(x) 6= σ(e)f(y), where Nk is a symmetric integer set of size k. We define the signedchromatic number of a graph G to be the minimum integer k such that for any signatureσ of G, (G, σ) has a k-colouring. Let f(n, k) be the maximum signed chromatic number ofan n-vertex k-chromatic graph. This paper determines the value of f(n, k) for all positiveintegers n ≥ k. Then we study list colouring of signed graphs. A list assignment L of Gis called symmetric if L(v) is a symmetric integer set for each vertex v. The weak signedchoice number chw±(G) of a graph G is defined to be the minimum integer k such that forany symmetric k-list assignment L of G, for any signature σ on G, there is a proper L-colouring of (G, σ). We prove that the difference chw±(G)−χ±(G) can be arbitrarily large.On the other hand, chw±(G) is bounded from above by twice the list vertex arboricity ofG. Using this result, we prove that chw±(K2?n) = χ±(K2?n) = d2n

3 e + b2n3 c. This is joint

work with Ringi Kim and Xuding Zhu.

t-common list colorings and some variations of list colorings

Young Soo Kwon

Yeungnam University, Korea

Abstract

In this talk, we introduce t-common list colorings and some variation of list colorings.For a graph G and for a given nonnegative integer t, a t-common list assignment of G isa mapping L from V (G) to all subsets of S for a set of colors S, such that given t colorsbelong to L(v) for every v ∈ V (G). The t-common list chromatic number of G denoted bycht(G) is defined as the minimum positive integer k such that there exists an L-coloringof G for every t-common list assignment L of G, satisfying |L(v)| ≥ k for every vertexv ∈ V (G). We show that for all positive integers k, ` with 2 ≤ k ≤ ` and i1, i2, . . . , ik−2

with k ≤ ik−2 ≤ · · · ≤ i1 ≤ `, there exists a graph G such that χ(G) = k, ch(G) = ` andcht(G) = it for every t = 1, . . . , k− 2. Moreover, we consider the t-common list chromaticnumber of planar graphs. By constructing a planar graph G such that ch1(G) = 5, weshow that the sharp upper bound for 1-common list chromatic number of planar graphsis 5. We also give some properties related to some variations of list colorings and suggestseveral questions related to these colorings.

5

An extension of Erdos-Gallai theorem with applications

Xing Peng

Tianjin University,China

Abstract

The famous Erdos-Gallai theorem gives an upper bound on the maximum number ofedges in graphs with given circumference. In this talk, we will first present an extensionof Erdos-Gallai theorem. Then we will discuss several applications of this extension tothe generalized Turan number and the consecutive length of cycles in graphs. Joint workwith Bo Ning.

3-colored asymmetric bipartite Ramsey number of connected matchings

and cycles

Yuejian Peng

Hunan University, China

Abstract

Let k, l,m be integers and r(k, l,m) be the minimum integer N such that for any red-blue-green coloring of KN,N , there is a red matching of size at least k in a component, ora blue matching of at least size l in a component, or a green matching of size at least min a component. We determine the exact value of r(k, l,m) completely which answers aquestion of Bucic, Letzter, and Sudakov. Applying a technique originated by Luczak thatapplies Szemeredi’s Regularity Lemma to reduce the problem of showing the existence of amonochromatic cycle to show the existence of a monochromatic matching in a component,we obtain the 3-colored asymmetric bipartite Ramsey number of cycles asymptotically.This is a joint work with Zhidan Luo.

6

Computing the list chromatic index of graphs

Uwe Schauz

Xi’an Jiaotong-Liverpool University, China

Abstract

As starting point, we formulate a corollary to the Quantitative Combinatorial Nullstel-lensatz. This corollary does not require the consideration of any coefficients of polynomi-als, only evaluations of polynomial functions. In certain situations, our corollary is moredirectly applicable and more ready-to-go than the Combinatorial Nullstellensatz itself. Itis also of interest from a numerical point of view. We use it to explain a well-known con-nection between the sign of 1-factorizations (edge colorings) and the List Edge ColoringConjecture. For efficient calculations and a better understanding of the sign, we thenintroduce and characterize the sign of single 1-factors. We show that the product overall signs of all the 1-factors in a 1-factorization is the sign of that 1-factorization. Usingthis result in an algorithm, we attempt to prove the List Edge Coloring Conjecture for allgraphs with up to 10 vertices. This leaves us with some exceptional cases that need to beattacked with other methods.

Linear bounds on characteristic polynomials of matroids

Suijie Wang

Hunan University, China

Abstract

Let χ(t) = a0tn−a1t

n−1+· · ·+(−1)rartn−r be the chromatic polynomial of a graph, the

characteristic polynomial of a matroid, or the characteristic polynomial of an arrangementof hyperplanes. For any integer k = 0, 1, . . . , r and real number x ≥ k − r − 1, we obtaina linear bound of the coefficient sequence, that is(

r + x

k

)≤

k∑i=0

ai

(x

k − i

)≤(m+ x

k

),

where m is the size of the graph, matroid, or hyperplane arrangement. It extends Whit-ney’s sign-alternating theorem, Meredith’s upper bound theorem, and Dowling and Wil-son’s lower bound theorem on the coefficient sequence. In the end, we also propose aproblem on the combinatorial interpretation of the above inequality.

7

Cover and variable degeneracy

Tao Wang

Henan University, China

Abstract

Let f be a nonnegative integer valued function on the vertex-set of a graph. A graphis strictly f-degenerate if each subgraph Γ has a vertex v such that degΓ(v) < f(v). Inthis paper, we define a new concept, strictly f -degenerate transversal, which generalize listcoloring, (f1, f2, . . . , fκ)-partition, signed coloring, DP-coloring and L-forested-coloring.A cover of a graph G is a graph H with vertex set V (H) =

⋃v∈V (G)Xv, where Xv =

{ (v, 1), (v, 2), . . . , (v, κ) }; the edge set M =⋃uv∈E(G) Muv, where Muv is the set of edges

between Xu and Xv, and it is a matching. A vertex set R ⊆ V (H) is a transversal of H if|R∩Xv| = 1 for each v ∈ V (G). A transversal R is a strictly f-degenerate transversalif H[R] is strictly f -degenerate. The main result is a degree type result, which generalizeBrooks’ theorem, Gallai’s theorem, degree-choosable, signed degree-colorable, DP-degree-colorable. Similar to Borodin, Kostochka and Toft’s variable degeneracy, the degree typeresult is also self-strengthening. Using these results, we can uniformly prove many newand known results.

Shortest circuit covers of signed graphs

Yezhou Wu

Zhejiang University, China

Abstract

A signed graph is a graph G associated with a mapping σ : E(G)→ {1,−1}, denotedby (G, σ). A cycle of (G, σ) is a connected 2-regular subgraph. A cycle C is positive if ithas an even number of negative edges, and negative otherwise. The definition of circuitof signed graph comes from the signed-graphic matroid. A circuit cover of (G, σ) is afamily of positive cycles and barbells covering all edges of (G, σ). A circuit cover withthe smallest total length is called a shortest circuit cover. Bouchet proved that a signedgraph with a circuit cover if and only if it has a nowhere-zero integer flow. In this talk,we introduce some recent developments of the shortest circuit covers of signed graphs.

This is joint work with Dong Ye.

8

Normal and non-normal Cayley graphs for isomorphic regular groups

Yian Xu

The University of Western Australia, Australia

Abstract

A Cayley graph Γ = Cay(G,S) is an NNN-graph for G if it is both normal and non-normal for regular subgroups isomorphic to G, that is, Aut(Γ) contains two isomorphicregular subgroups G,H where G is normal in Aut(Γ) and H is non-normal in Aut(Γ). Agroup G has the NNN-property if there exists an NNN-graph for G. It is known that theNNN-graphs are very rare, and only few examples are known. In this talk, we show thatmore NNN-graphs can be obtained by taking graph products on known NNN-graphs, inparticular, we show that the simple groups do not have the NNN-property and Zn doesnot have the NNN-property if 2 | n and 4 - n.

Equitable vertex arboricity of graphs

Xin Zhang

Xidian University, China

Abstract

The vertex arboricity a(G) of a graph G is the minimum number of subsets into whichthe vertex set V (G) can be partitioned so that each subset induces a forest. This notionwas introduced by Chartrand and Kronk [J. London Math. Soc., 44 (1969) 612-616], whoproved that a(G) ≤ 3 for every planar graph. Naturally we can consider the equitableversion of vertex arboricity when we restrict the partition to be an equitable one, thatis, a partition so that the size of each subset is either d|G|/ke or b|G|/kc. If the set ofvertices of a graph G can be equitably partitioned into k subsets such that each subset ofvertices induce a forest of G, then we call that G admits an equitable tree-k-coloring. Theminimum integer k such that G has an equitable tree-k-coloring is the equitable vertexarboricity aeq(G) of G. The notion of equitable vertex arboricity was first introduced byWu, Zhang and Li [Discrete Mathematics, 313 (2013) 2696–2701]. In this talk, I introducethe recent progress on this direction and present some of our new results.

9

List of ParticipantsName Institution Email

1 Shenxiao Bao Zhejiang Normal University 592712885@qq.com2 Yuehua Bu Zhejiang Normal University yhbu@zjnu.cn3 Jiaojiao Cao Zhejiang Normal University 2475106943@qq.com4 Dong Chen Zhejiang Normal University chendong@zjnu.cn5 Min Chen Zhejiang Normal University chenmin@zjnu.cn6 Rong Chen Fuzhou University rongchen@fzu.edu.cn7 Wenwen Chen Zhejiang Normal University 974320722@qq.com8 Xiuyang Chen Zhejiang Normal University xiuyangchen@126.com9 Yaxue Chen Zhejiang Normal University 839337548@qq.com10 Shuyu Cui Zhejiang Normal University cuishuyu@163.com11 Genghua Fan Fuzhou University fan@fzu.edu.cn12 Xuqian Fang Zhejiang Normal University 2529431786@qq.com13 Yuping Gao Lanzhou University gaoyp@lzu.edu.cn14 Gennian Ge Capital Normal University gnge@zju.edu.cn15 Jarosław Grytczuk Warsaw University of Technology, Poland j.grytczuk@mini.pw.edu.pl16 Xueyao Gui Zhejiang Normal University 1204938043@qq.com17 Jianxiu Hao Zhejiang Normal University sx35@zjnu.cn18 Rongxia Hao Beijing Jiaotong University rxhao@bjtu.edu.cn19 Jingxiang He Zhejiang Normal University 1242536953@qq.com20 Jianfeng Hou Fuzhou University jfhou@fzu.edu.cn

21 Xinmin Hou University of Science and Technology of China xmhou@ustc.edu.cn

22 Xiaolan Hu Central China Normal University xlhu@mail.ccnu.edu.cn23 Zhiquan Hu Central China Normal University Hu_zhiq@aliyun.com24 Danjun Huang Zhejiang Normal University hdanjun@zjnu.cn25 Nan Jiang Zhejiang Normal University 771260282@qq.com26 Yiting Jiang Zhejiang Normal University 787078533@qq.com27 Ligang Jin Zhejiang Normal University ligang.jin@zjnu.cn28 Zemin Jin Zhejiang Normal University zeminjin@zjnu.cn29 Seog-Jin Kim Konkuk University, Korea skim12@konkuk.ac.kr30 Jan Kratochvil Charles University, Czech Republic honza@kam.ms.mff.cuni.cz31 Young Soo Kwon Yeungnam University, Korea ysookwon@ynu.ac.kr32 Chunmiao Li Zhejiang Normal University 2630761564@qq.com33 Fengwei Li Shaoxing University fengwei.li@usx.edu.cn34 Xueliang Li Nankai University lxl@nankai.edu.cn35 Xuer Li Zhejiang Normal University 2284503734@qq.com36 Yang Li Soochow University yangli_lll@suda.edu.cn

Name Institution Email37 Yuan Li Zhejiang Normal University 1972267224@qq.com38 Kai Lin Zhejiang Normal University 3259167837@qq.com39 Qizhong Lin Fuzhou University linqizhong@fzu.edu.cn40 Hanquan Liu Zhejiang Normal University 490339417@qq.com41 Juan Liu Zhejiang Normal University 2632168685@qq.com42 Min Liu Zhejiang Normal University liumin3580@163.com43 Pengcheng Liu Zhejiang Normal University 1511522049@qq.com44 Huajing Lu Zhejiang Normal University emmalu1984@qq.com45 Quanfeng Lu Zhejiang Normal University 452911764@qq.com46 You Lu Northwestern Polytechnical University luyou@nwpu.edu.cn47 Kaiyi Luo Zhejiang Normal University 605986081@qq.com48 Xinzhong Lv Zhejiang Normal University lvxinzhong@zjnu.cn

49 Jie Ma University of Science and Technology of China jiema@ustc.edu.cn

50 Huiqun Mao Zhejiang Normal University 994403731@qq.com

51 Jaroslav Nešetřil Zhejiang Normal University, ChinaCharles University, Czech Republic nesetril@kam.mff.cuni.cz

52 Xing Peng Tianjin University x2peng@tju.edu.cn53 Yuejian Peng Hunan University ypeng1@hnu.edu.cn54 Jingran Qi Zhejiang Normal University 3102610849@qq.com55 Pu Qiao East China Normal University 235711gm@sina.com56 Uwe Schauz Xi'an Jiaotong-Liverpool University Uwe.Schauz@xjtlu.edu.cn57 Tingting Shan Zhejiang Normal University 15735291101@163.com

58 Ce Shi Shanghai Lixin University of Accounting and Finance shice060@lixin.edu.cn

59 Guixian Tian Zhejiang Normal University guixiantian@126.com60 Chao Wang Zhejiang Normal University 992178085@qq.com61 Chengmin Wang Taizhou University wcm@jiangnan.edu.cn62 Fang Wang Zhejiang Normal University 1602239788@qq.com63 Jiaqi Wang Zhejiang Normal University 864866745@qq.com64 Kan Wang Zhejiang Normal University wkan@zjnu.cn65 Suijie Wang Hunan University wangsuijie@gmail.com66 Tao Wang Henan University wangtao@henu.edu.cn67 Weifan Wang Zhejiang Normal University wwf@zjnu.cn68 Xiaofang Wang Zhejiang Normal University 11520971554@qq.com69 Yang Wang Zhejiang Normal University 457412583@qq.com70 Ying Wang Zhejiang Normal University zhuti@163.com71 Yingqian Wang Zhejiang Normal University yqwang@zjnu.cn

Name Institution Email72 Douglas B. West Zhejiang Normal University dwest@math.uiuc.edu73 Jianglin Wu Zhejiang Normal University 1838241157@qq.com74 Yezhou Wu Zhejiang University yezhouwu@zju.edu.cn75 Wenjing Xia Zhejiang Normal University 2273095722@qq.com76 Liqiong Xu JiMei University xuliqiong@jmu.edu.cn77 Wen Xu Zhejiang Normal University 2979023893@qq.com78 Baogang Xu Nanjing Normal University baogxu@njnu.edu.cn79 Miaodi Xu Zhejiang Normal University 2712503788@qq.com80 Ting Xu Zhejiang Normal University 1162366255@qq.com81 Yian Xu The University of Western Australia yian.xu@research.uwa.edu.au82 Huifang Yan Zhejiang Normal University hfy@zjnu.cn83 Jiayan Yan Zhejiang Normal University 673863520@qq.com84 Daqing Yang Zhejiang Normal University dyang@zjnu.edu.cn85 Wanshun Yang Zhejiang Normal University Yangwanshun224@163.com86 Yirong Yang Zhejiang Normal University 1548407272@qq.com87 Pingkang Yu Zhejiang Normal University 1242155812@qq.com88 Yao Yu Zhejiang Normal University 2457498954@qq.com89 Xingzhi Zhan East China Normal University zhan@math.ecnu.edu.cn90 Heng Zhang Zhejiang Normal University 312731473@qq.com91 Huajun Zhang Zhejiang Normal University huajinzhang@zjnu.cn92 Huijuan Zhang Zhejiang Normal University 1123090089@qq.com93 Jinrong Zhang Zhejiang Normal University 1534296788@qq.com94 Lu Zhang Zhejiang Normal University 303290816@qq.com95 Mengting Zhang Zhejiang Normal University 5943561022@qq.com96 Qian Zhang Zhejiang Normal University 1095911397@qq.com97 Xiaoxiu Zhang Zhejiang Normal University 1846418770@qq.com98 Xin Zhang Xidian University xzhang@xidian.edu.cn99 Xuemei Zhang Zhejiang Normal University xuemeiz@zjnu.cn100 Lina Zheng Zhejiang Normal University lnzheng@zjnu.cn101 Lu Zheng Zhejiang Normal University 552048986@qq.com102 Kangyun Zhong Zhejiang Normal University 2283899661@qq.com103 Hao Zhou Zhejiang Normal University 826777904@qq.com104 Aina Zhu Zhejiang Normal University 1076136503@qq.com105 Chaojie Zhu Zhejiang Normal University hzxszcj@163.com106 Jialu Zhu Zhejiang Normal University 709747529@qq.com107 Junlei Zhu Zhejiang Normal University zhujl-001@163.com108 Lijuan Zhu Zhejiang Normal University 1439837430@qq.com109 Xuding Zhu Zhejiang Normal University xdzhu@zjnu.edu.cn