Meng Ji

activity

20172026

most citedProper disconnection of graphs

3 citations · 5 across the 13 of their papers we have counts for

collaborators

13 papers

math.GM2026

An explicit connected-sum family with unbounded knot Ramsey-stick gap

Meng Ji

Let $R (K)$ and $s (K)$ denote the Ramsey number and the stick number of a knot $K$ . Johnson proved that $R - s$ is unbounded on $(p - 1, p)$ torus knots and asked whether other such fami…

math.CO2026

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 $c_{k}$ such that $r(C_{2k+1}, G)…

cs.AI2024

An Unsupervised Learning Framework Combined with Heuristics for the Maximum Minimal Cut Problem

Huaiyuan Liu, Xianzhang Liu, Donghua Yang +5

The Maximum Minimal Cut Problem (MMCP), a NP-hard combinatorial optimization (CO) problem, has not received much attention due to the demanding and challenging bi-connectivity cons…

math.CO2023

Complete bipartite graphs without small rainbow stars

Weizhen Chen, Meng Ji, Yaping Mao +1

The $k$ -edge-colored bipartite Gallai-Ramsey number $bgr_{k} (G : H)$ is defined as the minimum integer $n$ such that $n^{2} \geq k$ and for every $N \geq n$ , every edge-colo…

math.CO2022

A note on a new result related to Chartrand, Kaigars and Lick's theorem

Zhong Huang, Meng Ji

In this note, we prove a theorem covering Chartrand, Kaigars, and Lick's theorem in [Proc. Amer. Math. Soc. 32 (1972), 63-68]. As an application, we give a simpler proof of theorem…

math.CO2021

Asymptotic Bounds for CO-irredundant and Irredundant Ramsey Numbers

Meng Ji, Yaping Mao, Ingo Schiermeyer

A set of vertices $X \subseteq V$ in a simple graph $G (V, E)$ is irredundant (CO-irredundant) if each vertex $x \in X$ is either isolated in the induced subgraph $G [X]$ or else has a…

math.CO2020

Conflict-free connection number and independence number of a graph

Jing Wang, Meng Ji

An edge-colored graph $G$ 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…

math.CO2020

Note on the connectivity keeping spiders in $k$ -connected graphs

Meng Ji, Yaping Mao

W. Mader [J. Graph Theory 65 (2010), 61--69] conjectured that for any tree $T$ of order $m$ , every $k$ -connected graph $G$ with $δ (G) \geq ⌊ \frac{3 k}{2} ⌋ + m - 1$ contains a…

math.CO2019★ 3 cited

Proper disconnection of graphs

Xuqing Bai, You Chen, Meng Ji +3

For an edge-colored graph $G$ , a set $F$ of edges of $G$ is called a \emph{proper cut} if $F$ is an edge-cut of $G$ and any pair of adjacent edges in $F$ are assigned by different…

math.CO2019

Strong conflict-free connection of graphs

Meng Ji, Xueliang Li

A path $P$ 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 $P$ . An edge-colored graph $G$ is called \emph{co…

math.CO2018

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…

math.CO2018★ 2 cited

Conflict-free connections: algorithm and complexity

Meng Ji, Xueliang Li, Xiaoyu Zhu

A path in an(a) edge(vertex)-colored graph is called \emph{a conflict-free path} if there exists a color used on only one of its edges(vertices). An(A) edge(vertex)-colored graph i…

math.CO2017

Conflict-free connection of trees

Hong Chang, Meng Ji, Xueliang Li +1

We study the conflict-free connection coloring of trees, which is also the conflict-free coloring of the so-called edge-path hypergraphs of trees. We first prove that for a tree $T…