3 citations · 3 across the 7 of their papers we have counts for
7 papers · 1 filter
Ramsey size linear and generalization
Eng Keat Hng, Meng Ji, Ander Lamaison
More than thirty years ago, Erdős, Faudree, Rousseau, and Schelp posed a fundamental question in extremal graph theory: What is the optimal constant such that $r(C_{2k+1}, G)…
Complete bipartite graphs without small rainbow stars
Weizhen Chen, Meng Ji, Yaping Mao +1
The -edge-colored bipartite Gallai-Ramsey number is defined as the minimum integer such that and for every , every edge-colo…
Conflict-free connection number and independence number of a graph
Jing Wang, Meng Ji
An edge-colored graph is conflict-free connected if any two of its vertices are connected by a path, which contains a color used on exactly one of its edges. The conflict-free…
Proper disconnection of graphs
Xuqing Bai, You Chen, Meng Ji +3
For an edge-colored graph , a set of edges of is called a \emph{proper cut} if is an edge-cut of and any pair of adjacent edges in are assigned by different…
Strong conflict-free connection of graphs
Meng Ji, Xueliang Li
A path in an edge-colored graph is called \emph{a conflict-free path} if there exists a color used on only one of the edges of . An edge-colored graph is called \emph{co…
Erdös-Gallai-type results for conflict-free connection of graphs
Meng Ji, Xueliang Li
A path in an edge-colored graph is called \emph{a conflict-free path} if there exists a color used on only one of its edges. An edge-colored graph is called \emph{conflict-free con…