13 citations · 18 across the 10 of their papers we have counts for
10 papers
Strong chromatic index of bipartite graphs
Yanli Hao, Tianchi Yang, Xingxing Yu
An edge-coloring of a graph is called a strong edge-coloring if all its color classes are induced matchings in ; the minimum number of colors required for such a coloring, d…
A hypergraph bipartite Turán problem with odd uniformity
Jie Ma, Tianchi Yang
In this paper, we investigate the hypergraph Turán number . Here, denotes the -uniform hypergraph with vertex set $\left(\cup_{i\in [t]}X_i\…
Minimum Topology Attacks for Graph Neural Networks
Mengmei Zhang, Xiao Wang, Chuan Shi +3
With the great popularity of Graph Neural Networks (GNNs), their robustness to adversarial topology attacks has received significant attention. Although many attack methods have be…
On the maximum number of edges in k-critical graphs
Cong Luo, Jie Ma, Tianchi Yang
A graph is called -critical if its chromatic number is but any proper subgraph has chromatic number less than . An old and important problem in graph theory asks to deter…
On extremal numbers of the triangle plus the four-cycle
Jie Ma, Tianchi Yang
For a family of graphs, let denote the maximum number of edges in an -vertex graph which contains none of the members of as a sub…
Upper bounds on the extremal number of the 4-cycle
Jie Ma, Tianchi Yang
We obtain some new upper bounds on the maximum number of edges in -vertex graphs without containing cycles of length four. This leads to an asymptotically optimal bound o…
Non-repeated cycle lengths and Sidon sequences
Jie Ma, Tianchi Yang
We prove a conjecture of Boros, Caro, Füredi and Yuster on the maximum number of edges in a 2-connected graph without repeated cycle lengths, which is a restricted version of a lon…
Some exact results on -cycles: stability and supersaturation
Jialin He, Jie Ma, Tianchi Yang
Extremal problems on the -cycle played a heuristic important role in the development of extremal graph theory. A fundamental theorem of Füredi states that the Turán number…
Counting critical subgraphs in -critical graphs
Jie Ma, Tianchi Yang
Gallai asked in 1984 if any -critical graph on vertices contains at least distinct -critical subgraphs. The answer is trivial for . Improving a result of…
Decomposing -free graphs under degree constraints
Jie Ma, Tianchi Yang
A celebrated theorem of Stiebitz asserts that any graph with minimum degree at least can be partitioned into two parts which induce two subgraphs with minimum degree at lea…